Name
Abstract | ||
|---|---|---|
The asymptotic convergence of on-line algorithms when the number of training samples becomes infinite is well understood from a theoretical point of view (Adaptive Algorithms and Stochastic Approximations, Springer, Berlin, 1990, Advances in Neural Processing Systems 7, MIT Press, Boston, 1995, Theory and Practice of Recursive Identification, MIT Press, Boston, 1983). However, much less is known about the real convergence of these algorithms when the data sample size is finite. In this paper, we address the study of the real convergence of the popular K-means algorithm (Proceedings of the Fifth Berkeley Symposium on Mathematics, Statistics and Probablity, Vol. 1, 1967, 281) when it deals with finite data resources. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0925-2312(01)00626-9 | Neurocomputing |
Keywords | Field | DocType |
K-means algorithm,Asymptotic convergence,Online gradient descent,Finite-sample properties,Vector quantization | Convergence (routing),Applied mathematics,Neural processing,Computer science,Theoretical computer science,Vector quantization,Artificial intelligence,Recursion,k-means clustering,Sample (statistics),Data resources,Sample size determination,Machine learning | Journal |
Volume | Issue | ISSN |
48 | 1 | 0925-2312 |
Citations | PageRank | References |
4 | 0.42 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Bermejo | 1 | 87 | 12.49 |
| joan cabestany | 2 | 1276 | 143.82 |