共 41 条
Trends in Unsupervised Methodologies for Optimal K-Value Selection in Clustering Algorithms
被引:0
|作者:
Pegado-Bardayo, Ana
[1
]
Munuzuri, Jesus
[1
]
Escudero-Santana, Alejandro
[1
]
Lorenzo-Espejo, Antonio
[1
]
机构:
[1] Univ Seville, Dpto Organizac Ind & Gest Empresas 2, Escuela Tecn Super Ingn, Camino Descubrimientos S-N, Seville 41092, Spain
来源:
关键词:
Clustering;
k-value;
k-means;
unsupervised learning;
DATA SET;
NUMBER;
D O I:
10.1007/978-3-031-57996-7_49
中图分类号:
TP39 [计算机的应用];
学科分类号:
081203 ;
0835 ;
摘要:
Clustering algorithms are a powerful machine learning tool when working with large datasets, as they allow data to be grouped according to certain characteristics without the need to manually label the data. These algorithms generally request the number of clusters to be formed (k) as a parameter of the model and, while in some instances it is possible to indicate this number manually, most situations require this estimation to be an unsupervised task. The most widespread techniques offer acceptable results, but there is still much room for improvement. This study highlights their main shortcomings and reviews some of the advances in the estimation of this parameter presented in recent years, exploring their advantages and limitations.
引用
收藏
页码:282 / 287
页数:6
相关论文