On the unification of possibilistic fuzzy clustering: Axiomatic development and convergence analysis

被引:7
作者
Saha, Arkajyoti [1 ]
Das, Swagatam [2 ]
机构
[1] Indian Stat Inst, Stat Math Unit, 203 BT Rd, Kolkata 700108, WB, India
[2] Indian Stat Inst, Elect & Commun Sci Unit, 203 BT Rd, Kolkata 700108, WB, India
关键词
Fuzzy clustering; Possibilistic fuzzy clustering; Generalized contribution function; Penalty function; Axiomatic development; Alternative optimization; Convergence analysis; Closed graph theorem; C-MEANS; ALGORITHMS;
D O I
10.1016/j.fss.2017.07.005
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Fuzzy partitional clustering algorithms like Fuzzy C-means (FCM) are sensitive to noise points or outliers because of the probabilistic constraint (the sum of the membership values of a specific data point to all the clusters is 1), which enables it to classify any noise or outlier in a specific cluster. This, not only hampers the clustering performance corresponding to that specific point, but also leaves a huge impact on the overall clustering process by deviating the cluster centroids through a significant amount. In order to improve this weakness, possibilistic approach relaxes the probabilistic constraints. Nevertheless, due to lack of constraints imposed on the typicality matrix, depending on initialization, possibilistic clustering algorithms suffer from coincident clusters because their membership expressions do not consider the distance to other cluster representatives. Fuzzy possibilistic clustering which puts a linear constraint on the sum of all the typicality values, takes care of this problem, but if the number of data points is high, the generated typicality values are very small due to the linear constraint on their sums. In order to do away with that problem, the possibilistic fuzzy clustering algorithm was developed. In this article, we present an axiomatic development and extension of the possibilistic fuzzy clustering algorithm in three directions: choice of the dissimilarity measure, joint contribution function, and the penalty function. We provide a thorough convergence analysis of the proposed generalized possibilistic fuzzy clustering algorithm. We investigate the relationships of the proposed generalization with the existing variations of the Possibilistic C-Means (PCM), Fuzzy Possiblistic C-Means (FPCM) and Possibilistic Fuzzy C-Means (PFCM) algorithms in literature. To the best of our knowledge, this is the first article of its kind to provide a unification to the long list of possibilistic, fuzzy possiblistic, and possibilistic fuzzy clustering methods. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:73 / 90
页数:18
相关论文
共 34 条
[1]  
[Anonymous], 1969, NONLINEAR PROGRAMMIN
[2]  
[Anonymous], 2013, PATTERN RECOGN, DOI DOI 10.1007/978-1-4757-0450-1
[3]  
[Anonymous], 1997, Parallel Optimization: Theory, Algorithms, and Applications
[4]  
Banerjee A, 2005, J MACH LEARN RES, V6, P1705
[5]   ENTROPIC MEANS [J].
BENTAL, A ;
CHARNES, A ;
TEBOULLE, M .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1989, 139 (02) :537-551
[7]   C-MEANS CLUSTERING WITH THE L1 AND L-INFINITY NORMS [J].
BOBROWSKI, L ;
BEZDEK, JC .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1991, 21 (03) :545-554
[8]  
Borgelt C, 2013, ADV INTELL SYST COMP, V190, P3
[9]  
BREGMAN M., 1967, USSR Comput Math Math Phys, V7, P200, DOI [10.1016/0041-5553(67)90040-7, DOI 10.1016/0041-5553(67)90040-7]
[10]   AN ITERATIVE ROW-ACTION METHOD FOR INTERVAL CONVEX-PROGRAMMING [J].
CENSOR, Y ;
LENT, A .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1981, 34 (03) :321-353