Attribute weights-based clustering centres algorithm for initialising K-modes clustering

被引:2
|
作者
Liwen Peng
Yongguo Liu
机构
[1] University of Electronic Science and Technology of China,Knowledge and Data Engineering Laboratory of Chinese Medicine, School of Information and Software Engineering
来源
Cluster Computing | 2019年 / 22卷
关键词
Clustering centers; Weight; Density; Distance;
D O I
暂无
中图分类号
学科分类号
摘要
The K-modes algorithm based on partitional clustering technology is a very popular and effective clustering method; moreover, it handles categorical data. However, the performance of the K-modes method is largely affected by the initial clustering centres. Random selection of the initial clustering centres commonly leads to non-repeatable clustering result. Hence, suitable choice of the initial clustering centres is crucial to realizing high-performance K-modes clustering. The present article develops an initialisation algorithm for K-modes. At initialisation, the distance between two instances calculated after weighting the attributes of the instances. Many studies have shown that if clustering is based only on distances or density between the instances, the clustering revolves around one centre or the outliers. Therefore, based on the attribute weights, we combine the distance and density measures to select the clustering centres. In experiments on several UCI machine learning repository benchmark datasets, the new initialisation method outperformed the existing K-modes clustering methods.
引用
下载
收藏
页码:6171 / 6179
页数:8
相关论文
共 50 条
  • [31] K-Modes Clustering Algorithm Based on Weighted Overlap Distance and Its Application in Intrusion Detection
    Dai, Yawen
    Yuan, Guanghui
    Yang, Zhaoyuan
    Wang, Bin
    SCIENTIFIC PROGRAMMING, 2021, 2021
  • [32] A New Possibilistic Clustering Method: The Possibilistic K-Modes
    Ammar, Asma
    Elouedi, Zied
    AI(STAR)IA 2011: ARTIFICIAL INTELLIGENCE AROUND MAN AND BEYOND, 2011, 6934 : 413 - 419
  • [33] Privacy-preserving mechanisms for k-modes clustering
    Huu Hiep Nguyen
    COMPUTERS & SECURITY, 2018, 78 : 60 - 75
  • [34] Clustering categorical data: Soft rounding k-modes
    Gavva, Surya Teja
    Karthik, C. S.
    Punna, Sharath
    INFORMATION AND COMPUTATION, 2024, 296
  • [35] Feature-Weighted Fuzzy K-Modes Clustering
    Nataliani, Yessica
    Yang, Miin-Shen
    2019 3RD INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS, METAHEURISTICS & SWARM INTELLIGENCE (ISMSI 2019), 2019, : 63 - 68
  • [36] BINARY CODES K-MODES CLUSTERING FOR HSI SEGMENTATION
    Berthier, Michel
    El Asmar, Saadallah
    Frelicot, Carl
    2016 IEEE 12TH IMAGE, VIDEO, AND MULTIDIMENSIONAL SIGNAL PROCESSING WORKSHOP (IVMSP), 2016,
  • [37] A new method for initialising the K-means clustering algorithm
    Qing, Xiaoping
    Zheng, Shijue
    2009 SECOND INTERNATIONAL SYMPOSIUM ON KNOWLEDGE ACQUISITION AND MODELING: KAM 2009, VOL 2, 2009, : 41 - 44
  • [38] A High-Availability K-modes Clustering Method Based on Differential Privacy
    Zhang, Shaobo
    Yuan, Liujie
    Li, Yuxing
    Chen, Wenli
    Ding, Yifei
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2021, PT II, 2022, 13156 : 274 - 283
  • [39] Clustering of Categorical Data Using Intuitionistic Fuzzy k-modes
    Mehta, Darshan
    Tripathy, B. K.
    PROCEEDINGS OF SIXTH INTERNATIONAL CONFERENCE ON SOFT COMPUTING FOR PROBLEM SOLVING (SOCPROS 2016), VOL 1, 2017, 546 : 254 - 263
  • [40] Semantically Enhanced Clustering in Retail Using Possibilistic K-Modes
    Ammar, Asma
    Elouedi, Zied
    Lingras, Pawan
    ROUGH SETS AND KNOWLEDGE TECHNOLOGY, RSKT 2014, 2014, 8818 : 753 - 764