The Community for Technology Leaders
Green Image
<p>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.</p>
pattern recognition; decision theory; feature preserving clustering; 2D data; two class clustering; initial values; automatic hierarchical clustering
W.H. Tsai, J.C. Lin, "Feature-Preserving Clustering of 2-D Data for Two-Class Problems Using Analytical Formulas: An Automatic and Fast Approach", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 16, no. , pp. 554-560, May 1994, doi:10.1109/34.291439
172 ms
(Ver 3.3 (11022016))