An efficient algorithm for mining approximate frequent item over data streams

MaRDI QIDQ3610976zbMATH OpenFDO

Authors Weiping Wang, Dongdong Zhang, Longjiang Guo, Jianzhong Li

Publication date 6 March 2009

Full work available at URL https://semanticscholar.org/paper/695686e8b6145f98018628fa3edbe977a549f4b6

zbMATH Keywords

\(\varepsilon\)-approximatedata miningdata streamfrequent item

Mathematics Subject Classification ID

Data structures (68P05) Approximation algorithms (68W25)

Recommendations

• Mining approximate frequent itemsets over data streams using window sliding techniques
• Mining frequent items in data stream using time fading model
• scientific article; zbMATH DE number 2086663
• Finding frequent items in data streams
• Approximate mining of global closed frequent itemsets over data streams

Cited in

(11)

• Approximating frequent items in asynchronous data stream over a sliding window
• Study on discovering frequent items algorithm for distributed data stream
• A high-speed heuristic algorithm for mining frequent patterns in data stream
• Algorithm of frequent-patterns mining in data stream
• Study of a discovery method for useful data items in distributed data streams
• scientific article; zbMATH DE number 2086663 (Why is no real title available?)
• Mining frequent items in data stream using time fading model
• Mining approximate frequent itemsets over data streams using window sliding techniques
• Approximate frequent itemset mining in the presence of random noise
• Approximate mining of global closed frequent itemsets over data streams
• Finding frequent items over sliding windows with constant update time

This page was built for publication: An efficient algorithm for mining approximate frequent item over data streams

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