利用距离部分处理 K-Means 初始质心问题 (DP-KMeans)
机器学习
2019-03-20 v1
摘要
初始质心是 k-means 方法中一个相当具有挑战性的问题，因为它会影响聚类结果。此外，选择簇的起始质心并不总是合适的，尤其是当组数增加时。
引用
@article{arxiv.1903.07977,
title = {Tackling Initial Centroid of K-Means with Distance Part (DP-KMeans)},
author = {Ahmad Ilham and Danny Ibrahim and Luqman Assaffat and Achmad Solichan},
journal= {arXiv preprint arXiv:1903.07977},
year = {2019}
}
备注
This paper was presented at Proceeding of 2018 International Symposium on Advanced Intelligent Informatics (SAIN), 29-30 August 2018, Yogyakarta, Indonesia