FKMAWCW: Categorical fuzzy k-modes clustering with automated attribute-weight and cluster-weight learning

被引:22
作者
Oskouei, Amin Golzari [1 ]
Balafar, Mohammad Ali [1 ]
Motamed, Cina [2 ]
机构
[1] Univ Tabriz, Dept Comp Engn, Tabriz, Iran
[2] Univ Orleans, Dept Comp Sci, Orleans, France
关键词
Fuzzy k-modes; Attribute weighting; Cluster weighting; Clustering; C-MEANS; ALGORITHM;
D O I
10.1016/j.chaos.2021.111494
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The fuzzy k-modes (FKM) is a popular method for clustering categorical data. However, the main problem of this algorithm is that it is very sensitive to the initialization of primary clusters, so inappropriate initial cluster centers lead to poor local optima. Another problem with the FKM is the equal importance of the attributes used during the clustering process, which in real applications, the importance of the attributes are different, and some attributes are more important than others. Some versions of FKM have been presented in the literature, each of which has somehow solved one of the above problems. In this paper, we propose a new clustering method (FKMAWCW) to solve mentioned problems at the same time. In the proposed clustering process, a local attribute weighting mechanism is used to weight the attributes of each cluster properly. Also, a cluster weighting mechanism is proposed to solve the initialization sensitivity. Attribute weight and cluster weight are learned simultaneously and automatically during the clustering process. In addition, to reduce the noise sensitivity, a new distance function is proposed. So, the proposed algorithm can tolerate noisy environment. Extensive experiments on 11 benchmark datasets and an artificially generated dataset show that the proposed algorithm performs better than the stateof-the-art algorithms. This paper presents mathematical analyses to obtain updating functions, providing the convergence proof of the algorithm. The implementation source code of FKMAWCW is made publicly available at https://github.com/Amin- Golzari-Oskouei/FKMAWCW . (c) 2021 Elsevier Ltd. All rights reserved.
引用
收藏
页数:18
相关论文
共 58 条
[1]   K-Harmonic means type clustering algorithm for mixed datasets [J].
Ahmad, Amir ;
Hashmi, Sarosh .
APPLIED SOFT COMPUTING, 2016, 48 :39-49
[2]   TopicBERT: A cognitive approach for topic detection from multimodal post stream using BERT and memory-graph [J].
Asgari-Chenaghlu, Meysam ;
Feizi-Derakhshi, Mohammad-Reza ;
Farzinvash, Leili ;
Balafar, Mohammad-Ali ;
Motamed, Cina .
CHAOS SOLITONS & FRACTALS, 2021, 151
[3]   The k-modes type clustering plus between-cluster information for categorical data [J].
Bai, Liang ;
Liang, Jiye .
NEUROCOMPUTING, 2014, 133 :111-121
[4]   A novel attribute weighting algorithm for clustering high-dimensional categorical data [J].
Bai, Liang ;
Liang, Jiye ;
Dang, Chuangyin ;
Cao, Fuyuan .
PATTERN RECOGNITION, 2011, 44 (12) :2843-2861
[5]   An initialization method to simultaneously find initial cluster centers and the number of clusters for clustering categorical data [J].
Bai, Liang ;
Liang, Jiye ;
Dang, Chuangyin .
KNOWLEDGE-BASED SYSTEMS, 2011, 24 (06) :785-795
[6]  
Baradarani A, 2010, PATTERN RECOGN, P151
[7]   Swarm optimized cluster based framework for information retrieval [J].
Bhopale, Amol P. ;
Tiwari, Ashish .
EXPERT SYSTEMS WITH APPLICATIONS, 2020, 154
[8]   Clustering categorical data in projected spaces [J].
Bouguessa, Mohamed .
DATA MINING AND KNOWLEDGE DISCOVERY, 2015, 29 (01) :3-38
[9]   An Optimized K-Harmonic Means Algorithm Combined with Modified Particle Swarm Optimization and Cuckoo Search Algorithm [J].
Bouyer, Asgarali ;
Farajzadeh, Nacer .
JOURNAL OF INTELLIGENT SYSTEMS, 2020, 29 (01) :1-18
[10]   An efficient hybrid clustering method based on improved cuckoo optimization and modified particle swarm optimization algorithms [J].
Bouyer, Asgarali ;
Hatamlou, Abdolreza .
APPLIED SOFT COMPUTING, 2018, 67 :172-182