Sciweavers

582 search results - page 16 / 117
» Info-fuzzy algorithms for mining dynamic data streams
Sort
View
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
13 years 6 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...
CIKM
2009
Springer
15 years 10 months ago
Mining frequent itemsets in time-varying data streams
Mining frequent itemsets in data streams is beneficial to many real-world applications but is also a challenging task since data streams are unbounded and have high arrival rates...
Yingying Tao, M. Tamer Özsu
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
16 years 4 months ago
Accurate decision trees for mining high-speed data streams
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
João Gama, Pedro Medas, Ricardo Rocha
CCCG
2008
15 years 5 months ago
Core-Preserving Algorithms
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
Hamid Zarrabi-Zadeh
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
16 years 5 months ago
Dynamic Clustering of Evolving Streams with a Single Pass
Stream data is common in many applications, e.g., stock quotes, merchandize sales record, system logs, etc.. It is of great importance to analyze these stream data. As one of the ...
Jiong Yang