An Alternative to Center-based Clustering Algorithm via Statistical Learning Analysis
(2008) 4th International Conference on Intelligent Computing (ICIC 2008) — Location: Shanghai (China) (15.September.2008)
Files
pdfdocument.pdf
Restricted Access - Adobe PDF
- 477.54 KB
Details
- Authors
- Abstract
- This paper presents an alternative for center-based clustering algorithms, in particular the k-means algorithm, via statistical learning analysis. The essence of statistical learning principle, i.e., both the empirical risk and structural assessment, is taken into particular consideration for the clustering algorithm so as to derive and develop the relevant minimization mathematical criterion with automatic parameter learning and model selection in parallel. The proposed algorithm roughly decides on the number of clusters, by earning activation for the winners and assigning penalty for the rivals, so that the most competitive center wins for possible prediction and the extra ones are driven far away when starting the algorithm from a too large number of clusters without any prior knowledge. Simulation experiments prove the feasibility of the algorithm and show good performances of the double learning tasks during clustering.
- Affiliations
Citations
Rui Nian, Guangrong Ji, & Verleysen, M. (2008). An Alternative to Center-based Clustering Algorithm via Statistical Learning Analysis. Advanced Intelligent Computing Theories and Applications With Aspects of Artificial Intelligence., p. 693-700. https://doi.org/10.1007/978-3-540-85984-0_83