An algorithm for discovering the frequent closed itemsets in a large database

DOI10.1080/09528130600975758MaRDI QIDQ3429323zbMATH OpenOpenAlexFDO

Authors

Publication date 30 March 2007

Published in Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09528130600975758

zbMATH Keywords

latticefrequent closed itemsetsclosed tidsetsreduced IT-tree

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Database theory (68P15)

Recommendations

• An efficient algorithm for mining frequent maximal and closed itemsets
• A vertical algorithm for finding frequent closed itemsets and frequent generators
• Depth-first search algorithm for mining frequent closed itemsets
• An efficient algorithm of mining frequent closed inter-transaction itemsets

Cited in

(10)

• A vertical algorithm for finding frequent closed itemsets and frequent generators
• A novel algorithm for frequent itemset mining in data warehouses
• Identifying approximate itemsets of interest in large databases
• Meta itemset: a new concise representation of frequent itemset
• scientific article; zbMATH DE number 1964830 (Why is no real title available?)
• scientific article; zbMATH DE number 1839621 (Why is no real title available?)
• Cherry: an algorithm for mining frequent closed itemsets without subset checking
• Depth-first search algorithm for mining frequent closed itemsets
• An efficient rigorous approach for identifying statistically significant frequent itemsets
• Database Support for Data Mining Applications

This page was built for publication: An algorithm for discovering the frequent closed itemsets in a large database

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