An efficient algorithm for mining frequent maximal and closed itemsets

DOI10.3233/HIS-2009-0091MaRDI QIDQ3655433zbMATH OpenOpenAlexFDO

Authors Tarek F. Gharib

Publication date 7 January 2010

Published in International Journal of Hybrid Intelligent Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/his-2009-0091

zbMATH Keywords

blanketmaximal and closed itemsetsmining-frequent itemsets

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for mining maximal frequent itemsets based on datasets iteration and intersection pruning
• scientific article; zbMATH DE number 1983139
• MAXFP-Miner: mining maximal frequent itemsets efficiently by using FP-tree
• scientific article; zbMATH DE number 2202222
• scientific article; zbMATH DE number 2219521

Cited in

(15)

• scientific article; zbMATH DE number 6672129 (Why is no real title available?)
• scientific article; zbMATH DE number 2202222 (Why is no real title available?)
• An algebraic semigroup method for discovering maximal frequent itemsets
• scientific article; zbMATH DE number 1839621 (Why is no real title available?)
• A novel algorithm for frequent itemset mining in data warehouses
• Exploiting the formation of maximal cliques in social networks
• An algorithm for mining maximal frequent itemsets based on datasets iteration and intersection pruning
• An efficient algorithm of mining frequent closed inter-transaction itemsets
• A new algorithm for fast mining frequent itemsets using N-lists
• A novel bitmap-based algorithm for frequent itemsets mining
• scientific article; zbMATH DE number 5347083 (Why is no real title available?)
• Expressive generalized itemsets
• Depth-first search algorithm for mining frequent closed itemsets
• An algorithm for discovering the frequent closed itemsets in a large database
• scientific article; zbMATH DE number 2112391 (Why is no real title available?)

This page was built for publication: An efficient algorithm for mining frequent maximal and closed itemsets

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