Abstract Two fuzzy versions of the k-means optimal, least squared error partitioning problem are formulated for finite subsets X of a general inner product space. In both cases, the extremizing solutions are shown to be fixed points of a certain operator T on the class of fuzzy, k-partitions of X, and simple iteration of T provides an algorithm which has the descent property relative to the least squared error criterion function. In the first case, the range of T consists largely of ordinary (i.e. non-fuzzy) partitions of X and the associated iteration scheme is essentially the well known ISODATA process of Ball and Hall. However, in the second case, the range of T consists mainly of fuzzy partitions and the associated algorithm is new; when X consists of k compact well separated (CWS) clusters, Xi , this algorithm generates a limiting partition with membership functions which closely approximate the characteristic functions of the clusters Xi . However, when X is not the union of k CWS clusters, the limi...
[1]
P. Sneath.
The application of computers to taxonomy.
,
1957,
Journal of general microbiology.
[2]
George Nagy,et al.
Recognition of Printed Chinese Characters
,
1966,
IEEE Trans. Electron. Comput..
[3]
George Nagy,et al.
State of the art in pattern recognition
,
1968
.
[4]
Enrique H. Ruspini,et al.
A New Approach to Clustering
,
1969,
Inf. Control..
[5]
Martin D. Levine,et al.
An Algorithm for Detecting Unimodal Fuzzy Sets and Its Application as a Clustering Technique
,
1970,
IEEE Transactions on Computers.
[6]
Keinosuke Fukunaga,et al.
A Criterion and an Algorithm for Grouping Data
,
1970,
IEEE Transactions on Computers.
[7]
Charles T. Zahn,et al.
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
,
1971,
IEEE Transactions on Computers.