Author:
Malinen Mikko I.,Mariescu-Istodor Radu,Fränti Pasi
Subject
Artificial Intelligence,Computer Vision and Pattern Recognition,Signal Processing,Software
Reference23 articles.
1. NP-hardness of Euclidean sum-of-squares clustering;Aloise;Mach. Learn.,2009
2. M. Inaba, N. Katoh, H. Imai, Applications of weighted voronoi diagrams and randomization to variance-based k-clustering, in: Proceedings of the 10th Annual ACM Symposium on Computational Geometry (SCG 1994), 1994, pp. 332–339.
3. J. MacQueen, Some methods of classification and analysis of multivariate observations, in: Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, 1967, pp. 281–296.
4. D. Arthur, S. Vassilvitskii, How slow is the k-means method?, in: Proceedings of the 2006 Symposium on Computational Geometry (SoCG), 2006, pp. 144–153.
5. An empirical comparison of four initialization methods for the K-means algorithm;Peña;Pattern Recognit. Lett.,1999
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献