Author:
Wang Qiang,Wang Lu,Zeng Xiangyang,Zhao Lifan
Funder
National Natural Science Foundation of China
Fundamental Research Funds for the Central Universities
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computer Networks and Communications,General Neuroscience,Software
Reference28 articles.
1. Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 1027–1035
2. Bachem O, Lucic M, Hassani SH, Krause A (2016) Approximate k-means++ in sublinear time. In: AAAI, pp 1459–1467
3. Biernacki C, Celeux G, Govaert G (2000) Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Trans Pattern Anal Mach Intell 22(7):719–725
4. Bishop CM et al (2006) Pattern recognition and machine learning. Springer, New York, pp 4–12
5. Celebi ME, Kingravi HA, Vela PA (2013) A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Syst Appl 40(1):200–210
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献