A novel bitmap-based algorithm for frequent itemsets mining

DOI10.1007/978-3-642-15220-7_14MaRDI QIDQ3058093zbMATH OpenOpenAlexFDO

Authors János Abonyi

Publication date 18 November 2010

Published in Computational Intelligence in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15220-7_14

zbMATH Keywords

frequent itemsetsbittable

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• An improved algorithm based on sets operation for mining frequent itemsets
• Algorithm of mining frequent patterns based on the vertical bitmap
• A novel algorithm for frequent itemset mining in data warehouses
• scientific article; zbMATH DE number 1983139
• An efficient algorithm for mining frequent maximal and closed itemsets

Cited in

(7)

• Simple algorithms for frequent item set mining
• Efficiently using prime-encoding for mining frequent itemsets in sparse data
• A novel algorithm for frequent itemset mining in data warehouses
• Bitmap Index-Based Decision Trees
• Frequent itemsets mining segmentation algorithm based on vertical format
• Algorithm of mining frequent patterns based on the vertical bitmap
• Investigation of supports counting based on multi-level bitmap catalogue

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: A novel bitmap-based algorithm for frequent itemsets mining

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