Finding Robust Itemsets under Subsampling

DOI10.1145/2656261zbMath1474.68125arXiv1902.06743OpenAlexW2139963538MaRDI QIDQ5012498

Nikolaj Tatti, Fabian Mörchen, Toon Calders

Publication date: 25 November 2021

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.06743

zbMATH Keywords

pattern reductionclosed itemsetsfree itemsetsnon-derivable itemsetsrobust itemsetstotally shattered itemsets

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (3)

Knowledge cores in large formal contexts ⋮ On interestingness measures of formal concepts ⋮ Approximating concept stability using variance reduction techniques

This page was built for publication: Finding Robust Itemsets under Subsampling