Algorithm of mining frequent patterns based on the vertical bitmap

MaRDI QIDQ5453062zbMATH OpenFDO

Authors Cheng Lu, Ying Hao, Hantao Zhang

Publication date 4 April 2008

zbMATH Keywords

bit vectorNBFP-mine algorithmNBFP-Tree structurevertical bitmap

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 6672129
• A novel bitmap-based algorithm for frequent itemsets mining
• scientific article; zbMATH DE number 1983139
• scientific article; zbMATH DE number 2202222
• MAXFP-Miner: mining maximal frequent itemsets efficiently by using FP-tree

Cited in

(7)

• A novel algorithm for fast mining frequent patterns based on support list structure
• A compressed vertical binary algorithm for mining frequent patterns
• Frequent itemsets mining segmentation algorithm based on vertical format
• scientific article; zbMATH DE number 1755532 (Why is no real title available?)
• Investigation of supports counting based on multi-level bitmap catalogue
• Mining maximal frequent patterns in transactional databases and dynamic data streams: a Spark-based approach
• A novel bitmap-based algorithm for frequent itemsets mining

This page was built for publication: Algorithm of mining frequent patterns based on the vertical bitmap

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