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 条
  • [41] Analysis of metakaolin as supplementary cementing material by the k-value concept
    Borosnyi, Adorjn
    Szijarto, Anna
    [J]. EPITOANYAG-JOURNAL OF SILICATE BASED AND COMPOSITE MATERIALS, 2016, 68 (02): : 40 - 45
  • [42] CONTROL OF THE K-VALUE FOR RADIOGRAPHIC INSPECTION OF WELDED-JOINTS
    YAN, L
    [J]. BRITISH JOURNAL OF NON-DESTRUCTIVE TESTING, 1990, 32 (02): : 63 - 68
  • [43] Linearly optimum seeking K-value in the fitting of exponential and geometric
    陈长生
    徐勇勇
    张成岗
    [J]. Military Medical Research, 1996, (04) : 314 - 316
  • [44] Review on Supervised and Unsupervised Learning Techniques for Electrical Power Systems: Algorithms and Applications
    Chen, Songbo
    [J]. IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, 2021, 16 (11) : 1487 - 1499
  • [45] Pozzolanic reactivity of fly ash -: API method and K-value
    Yamamoto, Takeshi
    Kanazu, Tsutomu
    Nambu, Masateru
    Tanosaki, Takao
    [J]. FUEL, 2006, 85 (16) : 2345 - 2351
  • [46] A study of unsupervised clustering techniques for language modeling
    Hahn, Sangyun
    Sethy, Abhinav
    Kuo, Hong-Kwang J.
    Ramabhadran, Bhuvana
    [J]. INTERSPEECH 2008: 9TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION 2008, VOLS 1-5, 2008, : 1598 - +
  • [47] Unsupervised Feature Selection with Joint Clustering Analysis
    An, Shuai
    Wang, Jun
    Wei, Jinmao
    Yang, Zhenglu
    [J]. CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 1639 - 1648
  • [48] A unifying criterion for unsupervised clustering and feature selection
    Breaban, Mihaela
    Luchian, Henri
    [J]. PATTERN RECOGNITION, 2011, 44 (04) : 854 - 865
  • [49] Subspace clustering guided unsupervised feature selection
    Zhu, Pengfei
    Zhu, Wencheng
    Hu, Qinghua
    Zhang, Changqing
    Zuo, Wangmeng
    [J]. PATTERN RECOGNITION, 2017, 66 : 364 - 374
  • [50] Tie-Line-Based K-Value Method for Compositional Simulation
    Rannou, Guillaume
    Voskov, Denis
    Tchelepi, Hamdi
    [J]. SPE JOURNAL, 2013, 18 (06): : 1112 - 1122