Sciweavers

40 search results - page 3 / 8
» Dynamic Clustering of Evolving Streams with a Single Pass
Sort
View
ICDM
2009
IEEE
167views Data Mining» more  ICDM 2009»
13 years 3 months ago
Self-Adaptive Anytime Stream Clustering
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
Philipp Kranen, Ira Assent, Corinna Baldauf, Thoma...
ICDE
2007
IEEE
148views Database» more  ICDE 2007»
14 years 6 months ago
Conquering the Divide: Continuous Clustering of Distributed Data Streams
Data is often collected over a distributed network, but in many cases, is so voluminous that it is impractical and undesirable to collect it in a central location. Instead, we mus...
Graham Cormode, S. Muthukrishnan, Wei Zhuang
CVPR
2007
IEEE
14 years 7 months ago
From Videos to Verbs: Mining Videos for Activities using a Cascade of Dynamical Systems
Clustering video sequences in order to infer and extract activities from a single video stream is an extremely important problem and has significant potential in video indexing, s...
Pavan K. Turaga, Ashok Veeraraghavan, Rama Chellap...
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 7 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 5 months ago
Density-based clustering for real-time stream data
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
Yixin Chen, Li Tu