Sciweavers

279 search results - page 23 / 56
» Methods for finding frequent items in data streams
Sort
View
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 7 months ago
Approximately detecting duplicates for streaming data using stable bloom filters
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
Fan Deng, Davood Rafiei
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
CORR
2011
Springer
222views Education» more  CORR 2011»
12 years 11 months ago
A New Data Layout For Set Intersection on GPUs
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
Rasmus Resen Amossen, Rasmus Pagh
SIGMOD
2006
ACM
158views Database» more  SIGMOD 2006»
14 years 7 months ago
Continuous query processing in data streams using duality of data and queries
Recent data stream systems such as TelegraphCQ have employed the well-known property of duality between data and queries. In these systems, query processing methods are classified...
Hyo-Sang Lim, Jae-Gil Lee, Min-Jae Lee, Kyu-Young ...
DASFAA
2010
IEEE
225views Database» more  DASFAA 2010»
13 years 8 months ago
Mining Regular Patterns in Data Streams
Discovering interesting patterns from high-speed data streams is a challenging problem in data mining. Recently, the support metric-based frequent pattern mining from data stream h...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...