In this chapter we discuss three modifications of previous algorithms which have been proposed in an attempt to compensate for the difficulties caused by variations in cluster shape. The basic dilemma is that “clusters” defined by criterion functions usually take mathematical substance via metrical distances in data space. Each metric induces its own unseen but quite pervasive topological structure on ℝ p due to the geometric shape of the open balls it defines. This often forces the criterion function employing d to unwittingly favor clusters in X having this basic shape—even when none are present! In S21, we discuss a novel approach due to Backer which “inverts” several previous strategies. S22 considers an interesting modification of the FCM functional J m due to Gustafson and Kessel,(54) which uses a different norm for each cluster! S23 and S24 discuss generalization of the fuzzy c-means algorithms (A11.1) in a different way—the prototypes v i for J m (U, v) become r-dimensional linear varieties in ℝ p , 0 ≤ rp − 1.


Convex Combination Fuzzy Cluster Linear Variety Cluster Shape Hard Cluster 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Plenum Press, New York 1981

Authors and Affiliations

  • James C. Bezdek
    • 1
  1. 1.Utah State UniversityLoganUSA

Personalised recommendations