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

zbMATH Open1115.68390MaRDI QIDQ5485046FDOQ5485046

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

Publication date: 23 August 2006

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

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (14)

• Title not available (Why is that?)
• Mining maximal frequent itemsets in uncertain data
• Title not available (Why is that?)
• Title not available (Why is that?)
• New frequent pattern tree structure
• Title not available (Why is that?)
• Mining maximal frequent itemsets using the ordered FP-tree
• An efficient algorithm for mining frequent maximal and closed itemsets
• Title not available (Why is that?)
• Title not available (Why is that?)
• MAXFP-Miner
• 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
• Inverse Frequent Itemset Mining Based on FP-Tree

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)