Cherry: an algorithm for mining frequent closed itemsets without subset checking

DOI10.3724/SP.J.1001.2008.00379MaRDI QIDQ3406332zbMATH OpenOpenAlexFDO

Authors Limin Tao, Linpeng Huang

Publication date 12 February 2010

Published in Journal of Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1001.2008.00379

zbMATH Keywords

association rulefrequent closed itemset

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Depth-first search algorithm for mining frequent closed itemsets
• scientific article; zbMATH DE number 2112391
• An algorithm for discovering the frequent closed itemsets in a large database
• Mining frequent closed patterns over data stream
• An incremental algorithm for mining frequent closed patterns

This page was built for publication: Cherry: an algorithm for mining frequent closed itemsets without subset checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3406332)