Sciweavers

63 search results - page 8 / 13
» Finding frequent items in data streams
Sort
View
LATIN
2004
Springer
14 years 1 months ago
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such a...
Graham Cormode, S. Muthukrishnan
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 7 months ago
Finding Sequential Patterns from Large Sequence Data
Data mining is the task of discovering interesting patterns from large amounts of data. There are many data mining tasks, such as classification, clustering, association rule mini...
Mahdi Esmaeili, Fazekas Gabor
SIGMOD
2004
ACM
144views Database» more  SIGMOD 2004»
14 years 7 months ago
Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
PAKDD
2005
ACM
124views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Finding Sporadic Rules Using Apriori-Inverse
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
Yun Sing Koh, Nathan Rountree
JIIS
2008
133views more  JIIS 2008»
13 years 7 months ago
Maintaining frequent closed itemsets over a sliding window
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
James Cheng, Yiping Ke, Wilfred Ng