Approximate mining of global closed frequent itemsets over data streams
From MaRDI portal
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
Cites work
- A security-embedded infrastructure for tele-traffic speed control
- A time-varying stochastic framework for modeling wireless channels
- Chaos and control of discrete dynamic traffic model
- Frequency domain precision analysis and design of sliding mode observers
- MEMSWear-biomonitoring system for remote vital signs monitoring
Cited in
(9)- Mining frequent closed itemsets from a landmark window over online data streams
- An efficient closed frequent itemset miner for the MOA stream mining system
- Dual incremental fuzzy schemes for frequent itemsets discovery in streaming numeric data
- Distributed mining of frequent co-occurrence patterns across multiple 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
- An efficient algorithm for mining approximate frequent item over data streams
- Mining frequent closed patterns over data stream
- Mining approximate frequent itemsets over data streams using window sliding techniques
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)
