Mining approximate frequent itemsets over data streams using window sliding techniques
From MaRDI portal
Recommendations
- An efficient algorithm for mining approximate frequent item over data streams
- Mining recent frequent itemsets in sliding windows over data streams
- Approximate mining of global closed frequent itemsets over data streams
- MAX-FISM: mining (recently) maximal frequent itemsets over data streams using the sliding window model
- Mining frequent items in data stream using time fading model
Cited in
(13)- Dual incremental fuzzy schemes for frequent itemsets discovery in streaming numeric data
- Mining recent frequent itemsets in sliding windows over data streams
- scientific article; zbMATH DE number 6719310 (Why is no real title available?)
- MAX-FISM: mining (recently) maximal frequent itemsets over data streams using the sliding window model
- An efficient algorithm for mining approximate frequent item over data streams
- An efficient closed frequent itemset miner for the MOA stream mining system
- Mining frequent items in data stream using time fading model
- scientific article; zbMATH DE number 6452791 (Why is no real title available?)
- Dynamically computing approximate frequency counts in sliding window over data stream
- Approximate frequent itemset mining in the presence of random noise
- Approximate mining of global closed frequent itemsets over data streams
- Knowledge Discovery in Inductive Databases
- Finding frequent items over sliding windows with constant update time
This page was built for publication: Mining approximate frequent itemsets over data streams using window sliding techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305820)