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

DOI10.1016/J.INS.2014.03.074zbMATH Open1354.68075OpenAlexW2023511088MaRDI QIDQ506760FDOQ506760

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

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

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)

Cites Work

• Knowledge discovery from data streams.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Evolving fuzzy systems -- methodologies, advanced concepts and applications.
• 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

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)