Sciweavers

539 search results - page 37 / 108
» Online Algorithms for Mining Semi-structured Data Stream
Sort
View
SOFSEM
2009
Springer
15 years 10 months ago
Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study th...
Elvira Mayordomo, Philippe Moser
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
13 years 4 months ago
Searching and mining trillions of time series subsequences under dynamic time warping
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
Thanawin Rakthanmanon, Bilson J. L. Campana, Abdul...
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
16 years 2 months ago
Using retrieval measures to assess similarity in mining dynamic web clickstreams
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...
Olfa Nasraoui, Cesar Cardona, Carlos Rojas
107
Voted
IDA
2008
Springer
15 years 1 months ago
Mining frequent items in a stream using flexible windows
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its ...
Toon Calders, Nele Dexters, Bart Goethals
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
16 years 2 months ago
Online Maintenance of Very Large Random Samples
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
Chris Jermaine, Abhijit Pol, Subramanian Arumugam