8 search results - page 1 / 2 » Streaming Algorithms for k-Center Clustering with Outliers a... |
APPROX
2008
Springer
13 years 6 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...
ICDM
2009
IEEE
13 years 2 months ago
2009
IEEE
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...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
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...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such th...