JOURNAL ARTICLE
Mining top-K frequent itemsets from data streams
Raymond Chi-Wing WongAda Wai-Chee Fu
Year: 2006 Journal: Data Mining and Knowledge Discovery Vol: 13 (2)Pages: 193-217 Publisher: Springer Science+Business Media
Keywords:
Data stream mining Computer science Sliding window protocol Chernoff bound Data mining Lossy compression Set (abstract data type) Upper and lower bounds Data stream Window (computing) Algorithm Artificial intelligence Mathematics
Metrics
75
Cited By
13.94
FWCI (Field Weighted Citation Impact)
32
Refs
0.98
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Data Mining Algorithms and Applications
Physical Sciences → Computer Science → Information Systems
Data Management and Algorithms
Physical Sciences → Computer Science → Signal Processing
Rough Sets and Fuzzy Logic
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
Interactive mining of top-K frequent closed itemsets from data streams
Journal: Expert Systems with Applications Year: 2009 Vol: 36 (7)Pages: 10779-10788
JOURNAL ARTICLE
MINING TOP-K FREQUENT CLOSED ITEMSETS IN DATA STREAMS USING SLIDING WINDOW
Zahoor Ur RehmanMuhammad Qaiser Shahbaz
Journal: The Nucleus Year: 2013 Vol: 50 (3)Pages: 229-240
BOOK-CHAPTER
Using Bloom Filters for Mining Top-k Frequent Itemsets in Data Streams
Young-Hee KimKyung Soo ChoJae Yeol YoonIee Joon KimYoung‐Gab Kim
Communications in computer and information science Year: 2011 Pages: 209-216
JOURNAL ARTICLE
Mining Top-k Frequent-regular Itemsets from Data Streams Based on Sliding Window Technique
Tashinee MesamaKomate Amphawan
Year: 2018 Pages: 224-230
JOURNAL ARTICLE
Mining maximal frequent itemsets from data streams
Guojun MaoXindong WuXingquan ZhuGong ChenChunnian Liu
Journal: Journal of Information Science Year: 2007 Vol: 33 (3)Pages: 251-262