Open Access
A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters
J. C. Dunn
- Vol. 3, pp 32-57
Reads0
Chats0
TLDR
In this paper, 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, and 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 LSE criterion function.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...read more
Citations
More filters
Journal ArticleDOI
RFCM: A Hybrid Clustering Algorithm Using Rough and Fuzzy Sets
Pradipta Maji,Sankar K. Pal +1 more
TL;DR: A hybrid unsupervised learning algorithm, termed as rough-fuzzy c-means, is proposed, which comprises a judicious integration of the principles of rough sets and fuzzy sets and which enables efficient handling of overlapping partitions.
Journal ArticleDOI
Fuzzy competitive learning
Fu-Lai Chung,Tong Lee +1 more
TL;DR: The proposed fuzzy algorithms consist of various distinctive features such as converging more often to the desired solutions, or equivalently, reducing the likelihood of neuron underutilization that has long been a major shortcoming of crisp competitive learning.
Journal ArticleDOI
Fuzzy clustering analysis for optimizing fuzzy membership functions
Mu-Song Chen,Shinn-Wen Wang +1 more
TL;DR: This work proposes a heuristic method to calibrate the fuzzy exponent iteratively and a hybrid learning algorithm for refining the system parameters, based on the fuzzy c-means (FCM) Bezdek (1987) clustering algorithm.
Journal ArticleDOI
A Point Symmetry-Based Clustering Technique for Automatic Evolution of Clusters
TL;DR: A new symmetry-based genetic clustering algorithm is proposed which automatically evolves the number of clusters as well as the proper partitioning from a data set using a newly proposed PS-based cluster validity index, sym-index, as a measure of the validity of the corresponding partitioning.
Journal ArticleDOI
A modified possibilistic fuzzy c-means clustering algorithm for bias field estimation and segmentation of brain MR image
TL;DR: A modified possibilistic fuzzy c-means clustering algorithm is presented for fuzzy segmentation of magnetic resonance (MR) images that have been corrupted by intensity inhomogeneities and noise, capable of utilizing local contextual information to impose local spatial continuity, thus allowing the suppression of noise and helping to resolve classification ambiguity.
References
More filters
Journal ArticleDOI
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
TL;DR: A family of graph-theoretical algorithms based on the minimal spanning tree are capable of detecting several kinds of cluster structure in arbitrary point sets; description of the detected clusters is possible in some cases by extensions of the method.
Journal ArticleDOI
A new approach to clustering
TL;DR: A new method of representation of the reduced data, based on the idea of “fuzzy sets,” is proposed to avoid some of the problems of current clustering procedures and to provide better insight into the structure of the original data.
Journal ArticleDOI
The application of computers to taxonomy.
TL;DR: A method is described for handling large quantities of taxonomic data by an electronic computer so as to yield the outline of a classification based on equally weighted features that enables Similarity to be expressed numerically, and would allow taxonomic rank to be measured in terms of it.
Journal ArticleDOI
State of the art in pattern recognition
TL;DR: This paper reviews statistical, adaptive, and heuristic techniques used in laboratory investigations of pattern recognition problems and includes correlation methods, discriminant analysis, maximum likelihood decisions minimax techniques, perceptron-like algorithms, feature extraction, preprocessing, clustering and nonsupervised learning.
Journal ArticleDOI
An Algorithm for Detecting Unimodal Fuzzy Sets and Its Application as a Clustering Technique
I. Gitman,Martin D. Levine +1 more
TL;DR: It is proven that if certain assumptions are satisfied, then the algorithm will derive the optimal partition in the sense of maximum separation.