Efficiently using prime-encoding for mining frequent itemsets in sparse data

MaRDI QIDQ4684379zbMATH OpenFDO

Authors Karam Gouda, Mosab Hassaan

Publication date 28 September 2018

zbMATH Keywords

mining frequent itemsetsprime-block encodingsparse data

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• PRISM: an effective approach for frequent sequence mining via prime-block encoding
• A novel bitmap-based algorithm for frequent itemsets mining
• A new algorithm for fast mining frequent itemsets using N-lists
• Frequent itemsets mining segmentation algorithm based on vertical format
• Knowledge Discovery in Inductive Databases

Cited in

(1)

• PRISM: an effective approach for frequent sequence mining via prime-block encoding

This page was built for publication: Efficiently using prime-encoding for mining frequent itemsets in sparse data

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