This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Graph-Theoretic Approach to Nonparametric Cluster Analysis
September 1976 (vol. 25 no. 9)
pp. 936-944
Nonparametric clustering algorithms, including mode-seeking, valley-seeking, and unimodal set algorithms, are capable of identifying generally shaped clusters of points in metric spaces. Most mode and valley-seeking algorithms, however, are iterative and the clusters obtained are dependent on the starting classification and the assumed number of clusters. In this paper, we present a noniterative, graph-theoretic approach to nonparametric cluster analysis. The resulting algorithm is governed by a single-scalar parameter, requires no starting classification, and is capable of determining the number of clusters. The resulting clusters are unimodal sets.
Index Terms:
Clustering, mode seeking, pattern recognition, unimodal sets, valley-seeking clustering algorithms.
Citation:
W.L.G. Koontz, P.M. Narendra, K. Fukunaga, "A Graph-Theoretic Approach to Nonparametric Cluster Analysis," IEEE Transactions on Computers, vol. 25, no. 9, pp. 936-944, Sept. 1976, doi:10.1109/TC.1976.1674719
Usage of this product signifies your acceptance of the Terms of Use.