A cluster validity evaluation method for dynamically determining the near-optimal number of clusters

被引:0
|
作者
Xiangjun Li
Wei Liang
Xinping Zhang
Song Qing
Pei-Chann Chang
机构
[1] Nanchang University,School of Software
[2] Nanchang University,Department of Computer Science and Technology
[3] Jiangxi Vocational College of Industry and Engineering,undefined
[4] The First Affiliated Hospital of Nanchang University,undefined
来源
Soft Computing | 2020年 / 24卷
关键词
Cluster validity index; Euclidean distance; Dynamic clustering; Near-optimal number of clusters; Cluster validity evaluation;
D O I
暂无
中图分类号
学科分类号
摘要
Cluster validity evaluation is a hot issue in clustering algorithm research. Aiming at determining the optimal number of clusters in cluster validity evaluation, this paper proposes a new cluster validity index Ratio of Deviation of Sum-of-squares and Euclid distance (RDSED), and designs a cluster validity evaluation method based on RDSED which is suitable to dynamically determine the near-optimal number of clusters. Firstly, based on the analysis of the relationships of the intra-class and inter-class, the concepts of sum-of-squares of within-cluster, sum-of-squares of between-cluster, total sum-of-squares, sum of intra-cluster distance and average distance between clusters are proposed, and then a cluster validity index RDSED based on these concepts is constructed. Secondly, a cluster validity evaluation method based on RDSED for dynamically determining the near-optimal number of clusters is designed. In this method, RDSED value is calculated from large to small in the range of clustering number and this index value is used to dynamically terminate the clustering validity verification process, and finally the near-optimal number of clusters and clustering partition results are obtained. Experiment results of artificial datasets and real datasets show that, compared with some classical clustering validity evaluation method, the proposed cluster validity evaluation method can obtain the near-optimal number of clusters that is closest to the real cluster number in most cases and can effectively evaluate clustering partition results.
引用
收藏
页码:9227 / 9241
页数:14
相关论文
共 50 条
  • [31] Estimating the Optimal Number of Clusters Via Internal Validity Index
    Shibing Zhou
    Fei Liu
    Wei Song
    Neural Processing Letters, 2021, 53 : 1013 - 1034
  • [32] Near-Optimal Edge Evaluation in Explicit Generalized Binomial Graphs
    Choudhury, Sanjiban
    Javdani, Shervin
    Srinivasa, Siddhartha
    Scherer, Sebastian
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), 2017, 30
  • [33] Making 802.11 DCF Near-Optimal: Design, Implementation, and Evaluation
    Lee, Jinsung
    Lee, Hojin
    Yi, Yung
    Chong, Song
    Knightly, Edward W.
    Chiang, Mung
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (03) : 1745 - 1758
  • [34] Determining the optimal number of clusters using a new evolutionary algorithm
    Lu, W
    Traore, I
    ICTAI 2005: 17TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2005, : 712 - 713
  • [35] Deep learning for determining a near-optimal topological design without any iteration
    Yu, Yonggyun
    Hur, Taeil
    Jung, Jaeho
    Jang, In Gwun
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2019, 59 (03) : 787 - 799
  • [36] Deep learning for determining a near-optimal topological design without any iteration
    Yonggyun Yu
    Taeil Hur
    Jaeho Jung
    In Gwun Jang
    Structural and Multidisciplinary Optimization, 2019, 59 : 787 - 799
  • [37] Time-efficient near-optimal wavelength assignment in dynamically-reconfigurable WDM networks
    Ho, QD
    Lee, MS
    2005 Workshop on High Performance Switching and Routing, 2005, : 453 - 456
  • [38] Direct method for rapid prototyping of near-optimal aircraft trajectories
    Yakimenko, OA
    JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 2000, 23 (05) : 865 - 875
  • [39] A Near-optimal Non-myopic Active Learning Method
    Zhao, Yue
    Yang, Guosheng
    Xu, Xiaona
    Ji, Qiang
    2012 21ST INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR 2012), 2012, : 1715 - 1718
  • [40] Near-optimal, distributed edge colouring via the nibble method
    Dubhashi, D
    Grable, DA
    Panconesi, A
    THEORETICAL COMPUTER SCIENCE, 1998, 203 (02) : 225 - 251