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
c-means clustering with the l/sub l/ and l/sub infinity / norms
Leon Bobrowski,James C. Bezdek +1 more
TL;DR: This method broadens the applications horizon of the FCM family by enabling users to match discontinuous multidimensional numerical data structures with similarity measures that have nonhyperelliptical topologies.
Journal ArticleDOI
An integrated approach to fuzzy learning vector quantization and fuzzy c-means clustering
TL;DR: It is shown that the fuzzy c-means and fuzzy learning vector quantization algorithms are related to the proposed algorithms if the learning rate at each iteration is selected to satisfy a certain condition.
Proceedings ArticleDOI
A cluster estimation method with extension to fuzzy model identification
TL;DR: An efficient method for estimating cluster centers of numerical data and combining this cluster estimation method with a least squares estimation algorithm to provide a fast and robust method for identifying fuzzy models from input/output data is presented.
Journal ArticleDOI
The fuzzy decade: a bibliography of fuzzy systems and closely related topics
TL;DR: The main part of the paper consists of a bibliography of some 1150 items, each keyword-indexed with some 750 being classified as concerned with fuzzy system theory and its applications.
Journal ArticleDOI
Response of vegetation to different time-scales drought across China: Spatiotemporal patterns, causes and implications
TL;DR: Based on Normalized Difference Vegetation Index (NDVI) and Standardized Precipitation Evapotranspiration Index (SPEI), the authors investigated vegetation response to different time-scales drought across different vegetation types and homogeneous clusters in China, by annual maximum Pearson correlation (Rmax) and the corresponding timescales of drought.
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.