Sciweavers

279 search results - page 10 / 56
» Methods for finding frequent items in data streams
Sort
View
APPINF
2003
14 years 11 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
105
Voted
DATAMINE
2006
230views more  DATAMINE 2006»
14 years 9 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
109
Voted
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
14 years 10 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
PKDD
2010
Springer
124views Data Mining» more  PKDD 2010»
14 years 7 months ago
Summarising Data by Clustering Items
Abstract. For a book, the title and abstract provide a good first impression of what to expect from it. For a database, getting a first impression is not so straightforward. Whil...
Michael Mampaey, Jilles Vreeken
VLDB
2002
ACM
106views Database» more  VLDB 2002»
14 years 9 months ago
Approximate Frequency Counts over Data Streams
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
Gurmeet Singh Manku, Rajeev Motwani