A generalization of Possibilistic Fuzzy C-Means Method for Statistical Clustering of Data

被引:0
|
作者
Azzouzi S. [1 ]
El-Mekkaoui J. [2 ]
Hjouji A. [2 ]
Khalfi A.E.L. [1 ]
机构
[1] Mechanical engineering Laboratory, Faculty of Sciences and techniques, Sidi Mohamed Ben, Abdellah University, FEZ
[2] TI Laboratory, Superior School of Technology, Sidi Mohamed Ben Abdellah University, Fez
关键词
Fuzzy C-means (FCM); Fuzzy clustering; Possibilistic Fuzzy C-Means (PFCM); ·Possibilistic C-Means (PCM); Fuzzy Possibilistic C-Means (FPCM);
D O I
10.46300/9106.2021.15.191
中图分类号
学科分类号
摘要
The Fuzzy C-means (FCM) algorithm has been widely used in the field of clustering and classification but has encountered difficulties with noisy data and outliers. Other versions of algorithms related to possibilistic theory have given good results, such as Fuzzy C-Means(FCM), possibilistic C-means (PCM), Fuzzy possibilistic C-means (FPCM) and possibilistic fuzzy C-Means algorithm (PFCM).This last algorithm works effectively in some environments but encountered more shortcomings with noisy databases. To solve this problem, we propose in this manuscript, a new algorithm named Improved Possibilistic Fuzzy C-Means (ImPFCM) by combining the PFCM algorithm with a very powerful statistical method. The properties of this new ImPFCM algorithm show that it is not only applicable on clusters of spherical shapes, but also on clusters of different sizes and densities. The results of the comparative study with very recent algorithms indicate the performance and the superiority of the proposed approach to easily group the datasets in a large-dimensional space and to use not only the Euclidean distance but more sophisticated standards norms, capable to deal with much more complicated problems. On the other hand, we have demonstrated that the ImPFCM algorithm is also capable of detecting the cluster center with high accuracy and performing satisfactorily in multiple environments with noisy data and outliers. © 2021, North Atlantic University Union NAUN. All rights reserved.
引用
收藏
页码:1766 / 1780
页数:14
相关论文
共 50 条
  • [31] Interval-valued possibilistic fuzzy C-means clustering algorithm
    Ji, Zexuan
    Xia, Yong
    Sun, Quansen
    Cao, Guo
    FUZZY SETS AND SYSTEMS, 2014, 253 : 138 - 156
  • [32] A new validity index for fuzzy-possibilistic c-means clustering
    Zarandi, M. H. Fazel
    Sotodian, S.
    Castillo, O.
    SCIENTIA IRANICA, 2021, 28 (04) : 2277 - 2293
  • [33] Advanced Fuzzy Possibilistic C-means Clustering Based on Granular Computing
    Truong, Hung Quoc
    Ngo, Long Thanh
    Pedrycz, Witold
    2016 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2016, : 2576 - 2581
  • [34] A fuzzy clustering model of data and fuzzy c-means
    Nascimento, S
    Mirkin, B
    Moura-Pires, F
    NINTH IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS (FUZZ-IEEE 2000), VOLS 1 AND 2, 2000, : 302 - 307
  • [35] Generalized Possibilistic Fuzzy C-Means with novel cluster validity indices for clustering noisy data
    Askari, S.
    Montazerin, N.
    Zarandi, M. H. Fazel
    APPLIED SOFT COMPUTING, 2017, 53 : 262 - 283
  • [36] A Modified Fuzzy Possibilistic C-Means for Context Data Clustering toward Efficient Context Prediction
    Saad, Mohamed Fadhel
    Salah, Mohamed
    Lee, Jongyoun
    Kwon, Ohbyung
    NEW CHALLENGES FOR INTELLIGENT INFORMATION AND DATABASE SYSTEMS, 2011, 351 : 157 - +
  • [37] Generalization rules for the suppressed fuzzy c-means clustering algorithm
    Szilagyi, Laszlo
    Szilagyi, Sandor M.
    NEUROCOMPUTING, 2014, 139 : 298 - 309
  • [38] Fuzzy c-means clustering of incomplete data
    Hathaway, RJ
    Bezdek, JC
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2001, 31 (05): : 735 - 744
  • [39] Kernel Approach to Possibilistic C-Means Clustering
    Rhee, Frank Chung-Hoon
    Choi, Kil-Soo
    Choi, Byung-In
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2009, 24 (03) : 272 - 292
  • [40] Suppressed possibilistic c-means clustering algorithm
    Yu, Haiyan
    Fan, Jiulun
    Lan, Rong
    APPLIED SOFT COMPUTING, 2019, 80 : 845 - 872