CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams

DOI10.1016/J.INS.2014.03.074MaRDI QIDQ506760zbMATH OpenOpenAlexFDO

Authors Se Jung Shin, Dae Su Lee, Won Suk Lee

Publication date 2 February 2017

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2014.03.074

zbMATH Keywords

data miningdata streamfrequent itemsetstream data miningfrequent itemset compression

Mathematics Subject Classification ID

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

Recommendations

• Efficient single-pass frequent pattern mining using a prefix-tree
• Mining frequent closed itemsets from a landmark window over online data streams
• Efficient graph structure for the mining of frequent itemsets from data streams
• Mining recent frequent itemsets in sliding windows over data streams
• Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis

Cites work

• scientific article; zbMATH DE number 1947405 (Why is no real title available?)
• scientific article; zbMATH DE number 2086663 (Why is no real title available?)
• scientific article; zbMATH DE number 2119721 (Why is no real title available?)
• Evolving fuzzy systems -- methodologies, advanced concepts and applications.
• Knowledge discovery from data streams.
• Learning in non-stationary environments. Methods and applications
• Mining frequent closed itemsets from a landmark window over online data streams

Cited in

(1)

• Efficient single-pass frequent pattern mining using a prefix-tree

Describes a project that uses

Uses Software

• CLOSET

This page was built for publication: CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams

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