The effect of finite sample size on on-line K-means

DOI10.1016/S0925-2312(01)00626-9zbMATH Open1006.68795OpenAlexW2063818995WikidataQ58656628 ScholiaQ58656628MaRDI QIDQ1852003FDOQ1852003

Authors: Sergio Bermejo, Joan Cabestany 

Publication date: 9 January 2003

Published in: Neurocomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-2312(01)00626-9

Recommendations

• An algorithm for online \(k\)-means clustering
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• On the Consistency of k-means++ algorithm
• Étude exhaustive de l'algorithme de réallocation-recentrage dans un cas simple
• Convergence and Consistency of Fuzzy c-means/ISODATA Algorithms

zbMATH Keywords

asymptotic convergencevector quantization\(K\)-means algorithmfinite-sample propertiesonline gradient descent

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

This page was built for publication: The effect of finite sample size on on-line \(K\)-means

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1852003)