Name
Abstract | ||
|---|---|---|
In recent years, there have been major efforts to develop data stream algorithms that process inputs in one pass over the data with little memory requirement. For the k-means problem, this has led to the development of several $$1+\\varepsilon $$-approximations under the assumption that k is a constant, but also to the design of algorithms that are extremely fast in practice and compute solutions of high accuracy. However, when not only the length of the stream is high but also the dimensionality of the input points, then current methods reach their limits. We propose two algorithms, piecy and piecy-mr that are based on the recently developed data stream algorithm BICO that can process high dimensional data in one pass and output a solution of high quality. While piecy is suited for high dimensional data with a medium number of points, piecy-mr is meant for high dimensional data that comes in a very long stream. We provide an extensive experimental study to evaluate piecy and piecy-mr that shows the strength of the new algorithms. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-20086-6_20 | SEA |
Keywords | DocType | Volume |
k-means clustering,Data streams,SVD | Conference | abs/1502.04265 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan-Philipp W. Kappmeier | 1 | 0 | 0.34 |
| Daniel R. Schmidt | 2 | 0 | 0.34 |
| Melanie Schmidt 0001 | 3 | 0 | 0.68 |