Approximate mining of global closed frequent itemsets over data streams

DOI10.1016/J.JFRANKLIN.2011.04.006zbMATH Open1434.62250OpenAlexW1992858554MaRDI QIDQ553558FDOQ553558

Authors: Lichao Guo, Yu Qu, Hongye Su 

Publication date: 27 July 2011

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2011.04.006

Recommendations

• Mining approximate frequent itemsets over data streams using window sliding techniques
• An efficient algorithm for mining approximate frequent item over data streams
• Mining frequent closed itemsets from a landmark window over online data streams
• Mining frequent closed patterns over data stream
• An efficient closed frequent itemset miner for the MOA stream mining system

Mathematics Subject Classification ID

Statistics on algebraic and topological structures (62R99)

Cites Work

• Chaos and control of discrete dynamic traffic model
• Frequency domain precision analysis and design of sliding mode observers
• A security-embedded infrastructure for tele-traffic speed control
• MEMSWear-biomonitoring system for remote vital signs monitoring
• A time-varying stochastic framework for modeling wireless channels

Cited In (6)

• An efficient algorithm for mining approximate frequent item over data streams
• Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis
• Efficient graph structure for the mining of frequent itemsets from data streams
• Mining approximate frequent itemsets over data streams using window sliding techniques
• Mining frequent closed patterns over data stream
• Mining frequent closed itemsets from a landmark window over online data streams

This page was built for publication: Approximate mining of global closed frequent itemsets over data streams

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