Efficient graph structure for the mining of frequent itemsets from data streams

zbMATH Open1168.68370MaRDI QIDQ3534148FDOQ3534148

Authors: E. R. Naganthan, F. Ramesh Dhanaseelan 

Publication date: 3 November 2008

Recommendations

• Mining recent frequent itemsets in sliding windows over data streams
• Frequent mining of subgraph structures
• Fast mining frequent patterns in semi-structured data stream
• An efficient approach for mining frequent subgraphs
• Approximate mining of global closed frequent itemsets over data streams

zbMATH Keywords

association rule miningstream mining

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cited In (3)

• Discovering rare categories from graph streams
• Fast mining frequent patterns in semi-structured data stream
• CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams

This page was built for publication: Efficient graph structure for the mining of frequent itemsets from data streams

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