A Review of Unsupervised K-Value Selection Techniques in Clustering Algorithms

被引:0
|
作者
Pegado-Bardayo, Ana [1 ]
Lorenzo-Espejo, Antonio [1 ]
Munuzuri, Jesus [1 ]
Escudero-Santana, Alejandro [1 ]
机构
[1] Univ Seville, Seville, Spain
关键词
clustering; k-means; unsupervised learning; k-value; DATA SET; VALIDATION; NUMBER;
D O I
10.3926/jiem.6791
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Purpose: Automatic grouping of data according to certain characteristics is made possible by clustering algorithms, which makes them an essential tool when working with large datasets. However, although they are unsupervised tools, they generally require the specification of the number of clusters to be formed, k , a task that may be simple for a human, but quite complex to automate. Despite the most commonly used k-value selection techniques offer acceptable results, they are not without shortcomings, suggesting that there is ample room for improvement. This paper briefly introduces clustering techniques, discusses the main shortcomings of conventional k-value selection techniques and examines the advantages and limitations of nine promising alternatives presented in recent years. Design/methodology/approach: An evaluation of the main shortcomings of classic k- value estimation techniques has been carried out, and the newest proposals have been explained and compared. Findings: New k- value estimation indices and methodologies proposed by authors guarantee better results, extending the use of these techniques to large volumes of data, and complex shapes and structures. However, no generical methodology able to overcome all the described shortcomings has still been developed. Research limitations/implications: This research is limited to the newest developed techniques for k- value estimation, including proposals published since 2019. Older proposals have not been considered, as the newest ones overcome the former's shortcomings. A k- value estimation techniques review published in 2019 is cited in the test as a base reference. Practical implications: Although the examples listed in the text apply to industry, the techniques described and discussed in this review are applicable to any area of science that can benefit from the use of clustering techniques. Originality/value: To date, there has been no paper comparing the new k- value estimation techniques. Although there are literature reviews comparing the classical methods, these methods are nowadays nearly obsolete due to the complexity of the data usually faced.
引用
收藏
页码:641 / 649
页数:9
相关论文
共 50 条
  • [1] Trends in Unsupervised Methodologies for Optimal K-Value Selection in Clustering Algorithms
    Pegado-Bardayo, Ana
    Munuzuri, Jesus
    Escudero-Santana, Alejandro
    Lorenzo-Espejo, Antonio
    [J]. PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND INDUSTRIAL MANAGEMENT, ICIEIM-XXVII CONGRESO DE INGENIERIA DE ORGANIZACION, CIO 2023, 2024, 206 : 282 - 287
  • [2] Clustering algorithm based on k-value adaptive neighborhood selection
    Shen, Tianyu
    Wang, Youwei
    Du, Tao
    Qu, Shouning
    [J]. 2021 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE (CSCI 2021), 2021, : 604 - 608
  • [3] Spectral Clustering Based Unsupervised Feature Selection Algorithms
    Xie, Juan-Ying
    Ding, Li-Juan
    Wang, Ming-Zhao
    [J]. Ruan Jian Xue Bao/Journal of Software, 2020, 31 (04): : 1009 - 1024
  • [4] 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
    [J]. 2020 IEEE 20TH INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY, AND SECURITY (QRS 2020), 2020, : 160 - 167
  • [5] Concrete durability and the k-value concept
    Chroma, Marketa
    Rovnanikova, Pavla
    Teply, Bretislav
    Bergmeister, Konrad
    Strauss, Alfred
    [J]. CEMENT WAPNO BETON, 2014, 19 (02): : 81 - +
  • [6] CORRELATION IMPROVES K-VALUE PREDICTIONS
    KESLER, MG
    LEE, BI
    FISH, MJ
    HADDEN, ST
    [J]. HYDROCARBON PROCESSING, 1977, 56 (05): : 257 - 262
  • [7] On the selection of k efficient paths by clustering techniques
    Caramia, Massimiliano
    Giordani, Stefano
    [J]. INTERNATIONAL JOURNAL OF DATA MINING MODELLING AND MANAGEMENT, 2009, 1 (03) : 237 - 260
  • [8] Combination of Clustering and Ranking Techniques for Unsupervised Band Selection of Hyperspectral Images
    Datta, Aloke
    Ghosh, Susmita
    Ghosh, Ashish
    [J]. IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING, 2015, 8 (06) : 2814 - 2823
  • [9] Unsupervised hyperspectral band selection by combination of unmixing and sequential clustering techniques
    Benabadji, Sarra Ikram
    Karoui, Moussa Sofiane
    Djerriri, Khelifa
    Boukerch, Issam
    Farhi, Nezha
    Bouhlala, Mohammed Amine
    [J]. EUROPEAN JOURNAL OF REMOTE SENSING, 2019, 52 (01) : 30 - 39
  • [10] A new unsupervised feature selection method for text clustering based on genetic algorithms
    Pirooz Shamsinejadbabki
    Mohammad Saraee
    [J]. Journal of Intelligent Information Systems, 2012, 38 : 669 - 684