scispace - formally typeset
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

PENETRATE: Personalized news recommendation using ensemble hierarchical clustering

TL;DR: PENETRATE is proposed, a novel PErsonalized NEws recommendaTion framework using ensemble hieRArchical clusTEring to provide attractive recommendation results and extensive empirical experiments demonstrate the efficacy of the proposed approach.
Journal ArticleDOI

An effective partitional clustering algorithm based on new clustering validity index

TL;DR: A new variance based clustering validity index (VCVI) from the point of view of spatial distribution of datasets is designed and a new partitional clustering algorithm integrated with the improved K-means algorithm and the newly introduced VCVI is designed to optimize and determine the optimal clustering number (Kopt) for a wide range of datasets.
DissertationDOI

Knowledge Discovery from Sequential Data

TL;DR: A new framework for analyzing sequential or temporal data such as time series is proposed, with special emphasis on the interpretability of the results, which makes it possible to deal with irregular or chaotic series.
Journal ArticleDOI

A study on fuzzy clustering for magnetic resonance brain image segmentation using soft computing approaches

TL;DR: A novel hybrid GA-BFO-FCM algorithm for MR brain image segmentation using pixel intensity values by optimum boundary point detection (OBPD) method is presented and significantly improves segmentation results as compared to other methods.
Journal ArticleDOI

3D Computerized Segmentation of Lung Volume With Computed Tomography

TL;DR: 3D-based segmentation method for segmenting and visualizing lung volume by using CT images can be integrated into a picture archiving and communication system serving as a visualization tool for radiologists' reading and interpretation.
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

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.