MAXFP-Miner: mining maximal frequent itemsets efficiently by using FP-tree

MaRDI QIDQ5485046zbMATH OpenFDO

Authors Huiping Chen, Jian-Dong Wang, Fei-Yue Ye

Publication date 23 August 2006

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 2202222
• scientific article; zbMATH DE number 6672129
• Mining maximal frequent itemsets using the ordered FP-tree
• scientific article; zbMATH DE number 1983139
• scientific article; zbMATH DE number 1983144

Cited in

(14)

• MAXFP-Miner
• Mining maximal frequent itemsets in uncertain data
• scientific article; zbMATH DE number 6672129 (Why is no real title available?)
• Inverse Frequent Itemset Mining Based on FP-Tree
• Mining maximal frequent itemsets using the ordered FP-tree
• scientific article; zbMATH DE number 5522675 (Why is no real title available?)
• New frequent pattern tree structure
• An efficient algorithm for mining frequent maximal and closed itemsets
• scientific article; zbMATH DE number 1983139 (Why is no real title available?)
• scientific article; zbMATH DE number 1983144 (Why is no real title available?)
• scientific article; zbMATH DE number 2033276 (Why is no real title available?)
• scientific article; zbMATH DE number 2202222 (Why is no real title available?)
• Algorithm of mining frequent patterns based on the vertical bitmap
• Mining maximal frequent patterns in transactional databases and dynamic data streams: a Spark-based approach

This page was built for publication: MAXFP-Miner: mining maximal frequent itemsets efficiently by using FP-tree

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