• Publication
  • 1994
  • Issue No. 5 - May
  • Abstract - Feature-Preserving Clustering of 2-D Data for Two-Class Problems Using Analytical Formulas: An Automatic and Fast Approach
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Feature-Preserving Clustering of 2-D Data for Two-Class Problems Using Analytical Formulas: An Automatic and Fast Approach
May 1994 (vol. 16 no. 5)
pp. 554-560

We propose a new method to perform two-class clustering of 2-D data in a quick and automatic way by preserving certain features of the input data. The method is analytical, deterministic, unsupervised, automatic, and noniterative. The computation time is of order n if the data size is n, and hence much faster than any other method which requires the computation of an n-by-n dissimilarity matrix. Furthermore, the proposed method does not have the trouble of guessing initial values. This new approach is thus more suitable for fast automatic hierarchical clustering or any other fields requiring fast automatic two-class clustering of 2-D data. The method can be extended to cluster data in higher dimensional space. A 3-D example is included.

[1] A. Rosenfeld and A. Kak,Digital Picture Processing, New York: Academic, 1976.
[2] D. Lecompte, L. Kaufman, and P. J. Rousseeuw, "Hierarchical cluster analysis of emotional concerns and personality characteristics in a freshman population,"Acta Psychiatrica Belgica, vol. 86, pp. 324-333, 1986.
[3] R. I. Hathaway and J. C. Bezdek, "Recent convergence results for the fuzzyc-means clustering algorithms,"J. Classification, vol. 2, pp. 29-39, 1988.
[4] L. Kaufman and P. J. Rousseeuw,Finding Groups in Data. New York: John Wiley&Sons, 1990.
[5] A. J. Tabatabai and O. R. Mitchell, "Edge location to subpixel values in digital imagery,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 188-201, Mar. 1984.
[6] W. H. Tsai, "Moment--preserving thresholding: A new approach,"Comput. Vision Graphics Image Process., vol. 29, pp. 377-393, 1985.
[7] J. C. Lin, "Universal principal axis : an easy-to-construct tool useful in defining shape orientations for almost every kind of shape,"Pattern Recognit., vol. 26, pp. 485-493, 1993.
[8] J. C. Lin, "Analytical approach of clustering techniques with applications," Nat. Sci. Council Tech. Rep., No. NSC81-0408-E-009-589, National Chiao Tung Univ., Taiwan, Republic of China, 1992.
[9] IMSL,Int. Mathematical and Statistical Library. IMSL, Houston, TX, 1989.
[10] P. A. Devijver and J. Kittler,Pattern Recognition: a Statistical Approach. London: Prentice-Hall, 1982, p.406.
[11] J. A. Hartigan and M. A. Wong, "Ak-means clustering algorithm,"Applied Statistics, vol. 28, pp. 100-108, 1979.
[12] G. Nagy, "State of the art in pattern recognition,"Proc. IEEE, vol. 56, pp. 836-862, May, 1968.
[13] C. T. Zahn, "Graph-theoretical methods for detecting and describing gestalt clusters,"IEEE Trans. Comput., vol. C-20, pp. 68-86, Jan. 1971.

Index Terms:
pattern recognition; decision theory; feature preserving clustering; 2D data; two class clustering; initial values; automatic hierarchical clustering
Citation:
J.C. Lin, W.H. Tsai, "Feature-Preserving Clustering of 2-D Data for Two-Class Problems Using Analytical Formulas: An Automatic and Fast Approach," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 5, pp. 554-560, May 1994, doi:10.1109/34.291439
Usage of this product signifies your acceptance of the Terms of Use.