A modification to improve possibilistic fuzzy cluster analysis

25 June 2003

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

Vol. 2, 1460-1465
https://doi.org/10.1109/fuzz.2002.1006721

Abstract

We explore an approach to possibilistic fuzzy clustering that avoids a severe drawback of the conventional approach, namely that the objective function is truly minimized only if all cluster centers are identical. Our approach is based on the idea that this undesired property can be avoided if we introduce a mutual repulsion of the clusters, so that they are forced away from each other. We develop this approach for the possibilistic fuzzy c-means algorithm and the Gustafson-Kessel algorithm.

Keywords

This publication has 5 references indexed in Scilit:

Fuzzy Models and Algorithms for Pattern Recognition and Image Processing
Published by Springer Nature ,1999
Robust clustering methods: a unified view
IEEE Transactions on Fuzzy Systems, 1997
A possibilistic approach to clustering
IEEE Transactions on Fuzzy Systems, 1993
Possibility Theory
Published by Springer Nature ,1988
Pattern Recognition with Fuzzy Objective Function Algorithms
Published by Springer Nature ,1981