226 search results - page 2 / 46 » Approximate Clustering on Distributed Data Streams |
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
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...
IPPS
2010
IEEE
13 years 3 months ago
2010
IEEE
DASFAA
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. Moving object environments are characterized by large numbers of objects continuously sending location updates. At times, data arrival rates may spike up, causing the loa...
ESANN
2008
13 years 6 months ago
2008
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
PAKDD
2005
ACM
13 years 10 months ago
2005
ACM
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...