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
相关论文
共 41 条
  • [1] A Review of Unsupervised K-Value Selection Techniques in Clustering Algorithms
    Pegado-Bardayo, Ana
    Lorenzo-Espejo, Antonio
    Munuzuri, Jesus
    Escudero-Santana, Alejandro
    JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT-JIEM, 2024, 17 (03): : 641 - 649
  • [2] Clustering algorithm based on k-value adaptive neighborhood selection
    Shen, Tianyu
    Wang, Youwei
    Du, Tao
    Qu, Shouning
    2021 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE (CSCI 2021), 2021, : 604 - 608
  • [3] An Approach to Determine the Optimal k-Value of K-means Clustering in Adaptive Random Testing
    Chen, Jinfu
    Zhao, Lingling
    Zhou, Minmin
    Liu, Yisong
    Qin, Songling
    2020 IEEE 20TH INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY, AND SECURITY (QRS 2020), 2020, : 160 - 167
  • [4] Spectral Clustering Based Unsupervised Feature Selection Algorithms
    Xie J.-Y.
    Ding L.-J.
    Wang M.-Z.
    Ruan Jian Xue Bao/Journal of Software, 2020, 31 (04): : 1009 - 1024
  • [5] Determining an Optimal Value of K in K-means Clustering
    Mehar, Arshad Muhammad
    Matawie, Kenan
    Maeder, Anthony
    2013 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2013,
  • [6] A new unsupervised feature selection method for text clustering based on genetic algorithms
    Pirooz Shamsinejadbabki
    Mohammad Saraee
    Journal of Intelligent Information Systems, 2012, 38 : 669 - 684
  • [7] A new unsupervised feature selection method for text clustering based on genetic algorithms
    Shamsinejadbabki, Pirooz
    Saraee, Mohammad
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2012, 38 (03) : 669 - 684
  • [8] Unsupervised Bayesian feature selection based on k-means clustering
    Yan, Liu
    Yan, Peng
    IC-BNMT 2007: PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON BROADBAND NETWORK & MULTIMEDIA TECHNOLOGY, 2007, : 352 - 356
  • [9] K-means tree: an optimal clustering tree for unsupervised learning
    Tavallali, Pooya
    Tavallali, Peyman
    Singhal, Mukesh
    JOURNAL OF SUPERCOMPUTING, 2021, 77 (05): : 5239 - 5266
  • [10] K-means tree: an optimal clustering tree for unsupervised learning
    Pooya Tavallali
    Peyman Tavallali
    Mukesh Singhal
    The Journal of Supercomputing, 2021, 77 : 5239 - 5266