A Nonparametric Algorithm for Detecting Clusters Using Hierarchical Structure
Riichiro Mizoguchi, Masamichi Shimura · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1980
The present paper discusses a nonparametric algorithm for detecting clusters. In the algorithm a positive value called potential is associated with each datum based on dissimilarities. By defining subordination relations among data, hierarchical structure is introduced into the data set. As a result of the introduction of hierarchical structure, the data set is divided into some subsets called subclusters. A procedure for constructing clusters from the subclusters is also considered. The proposed algorithm can be applied to a very wide range of data set and has great ability to detect clusters, which is verified by computer simulation.
Cited by 20 works. doi:10.1109/tpami.1980.4767028
Authors
References
- Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis
- Hierarchical Grouping to Optimize an Objective Function
- The Analysis of Proximities: Multidimensional Scaling with an Unknown Distance Function. I.
- Hierarchical Clustering Schemes
- Nonmetric Multidimensional Scaling: A Numerical Method
- A Nonlinear Mapping for Data Structure Analysis
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- On Some Invariant Criteria for Grouping Data
- The Analysis of Proximities: Multidimensional Scaling with an Unknown Distance Function. II
- An Analysis of Some Graph Theoretical Cluster Techniques