This Article 
 Bibliographic References 
 Add to: 
A Similarity-Based Robust Clustering Method
April 2004 (vol. 26 no. 4)
pp. 434-448

Abstract—This paper presents an alternating optimization clustering procedure called a similarity-based clustering method (SCM). It is an effective and robust approach to clustering on the basis of a total similarity objective function related to the approximate density shape estimation. We show that the data points in SCM can self-organize local optimal cluster number and volumes without using cluster validity functions or a variance-covariance matrix. The proposed clustering method is also robust to noise and outliers based on the influence function and gross error sensitivity analysis. Therefore, SCM exhibits three robust clustering characteristics: 1) robust to the initialization (cluster number and initial guesses), 2) robust to cluster volumes (ability to detect different volumes of clusters), and 3) robust to noise and outliers. Several numerical data sets and actual data are used in the SCM to show these good aspects. The computational complexity of SCM is also analyzed. Some experimental results of comparing the proposed SCM with the existing methods show the superiority of the SCM method.

[1] M. Barni, V. Cappellini, and A. Mecocci, Comments on: A Possibilistic Approach to Clustering IEEE Trans. Fuzzy Systems, vol. 4, pp. 393-396, 1996.
[2] J.C. Bezdek, Pattern Reccognition with Fuzzy Objectiv Function Algorithm. Plenum Press, 1981.
[3] J.C. Bezdek, Cluster Validity with Fuzzy Sets J. Cybernetics, vol. 3, pp. 58-73, 1974.
[4] P.J. Bickel and K.A. Doksum, Mathematical Statistics, second ed. Prentice-Hall, 2001.
[5] S.L. Chiu, Fuzzy Model Identification Based on Cluster Estimation J. Intelligent and Fuzzy Systems, vol. 2, pp. 267-278, 1994.
[6] R.N. Dave, Characterization and Detection of Noise in Clustering Pattern Recognition Letters, vol. 12, pp. 657-664, 1991.
[7] R.N. Dave and R. Krishnapuram, Robust Clustering Methods: A Unified View IEEE Trans. Fuzzy Systems, vol. 5, pp. 270-293, 1997.
[8] D.L. Davies and D.W. Bouldin, A Cluster Separation Measure IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, pp. 224-227, 1979.
[9] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. Wiley, 1973.
[10] H. Frigui and R. Krishnapuram, Clustering by Competitive Agglomeration Pattern Recognition, vol. 30, pp. 1223-1232, 1997.
[11] H. Frigui and R. Krishnapuram, “A Robust Competitive Clustering Algorithm with Applications in Computer Visions,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 5, pp. 450- 465, May 1999.
[12] I. Gath and A.B. Geva, Unsupervised Optimal Fuzzy Clustering IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 773-781, 1989.
[13] S. Grossberg, Adaptive Pattern Classification and Universal Recoding, I: Parallel Development and Coding of Neural Feature Detectors Biological Cybernetics, vol. 23, pp. 121-134, 1976.
[14] E.E. Gustafson and W.C. Kessel, Fuzzy Clustering with a Fuzzy Matrix Proc. IEEE Conf. Design and Control, pp. 761-766, 1979.
[15] J.A. Hartigan, Clustering Algorithms. Wiley, 1975.
[16] P.J. Huber, Robust Statistics. Wiley, 1981.
[17] A.K. Jain, R.P.W. Duin, and J. Mao, Statistical Pattern Recognition: A Review IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 1, pp. 4-37, Jan. 2000.
[18] J. Jolion,P. Meer,, and S. Bataouche,“Robust clustering with applications in computer vision,” IEEE Trans. Pattern Analysis amd Machine Intelligence, vol. 13, no. 8, pp. 791-801, Aug. 1991.
[19] L. Kaufman and P.J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, 1990.
[20] T. Kohonen, Learning Vector Quantization Neural Network, vol. 1, p. 303 1988.
[21] R. Krishnapuram, H. Frigui, and O. Nasraoui, Fuzzy and Possibilistic Shell Clustering Algorithm and Their Application to Boundary Detection and Surface Approximation IEEE Trans. Fuzzy Systems, vol. 3 pp. 29-60, 1995.
[22] R. Krishnapuram and J.M. Keller, “A Possibilistic Approach to Clustering,” IEEE Fuzzy Systems, vol. 1, no. 2, pp. 98-110, 1993.
[23] R.P. Lippmann, "An Introduction to Computing with Neural Nets," IEEE Acoustics, Speech, and Signal Processing Magazine, vol. 4, pp. 4-22, Apr. 1987.
[24] N.R. Pal and J.C. Bezdek, On Cluster Validity for Fuzzy$c{\hbox{-}}\rm Means$Model IEEE Trans. Fuzzy Systems, vol. 1, pp. 370-379, 1995.
[25] G.J. McLachlan and K.E. Basford, Mixture Models: Inference and Applications to Clustering. New York: Marcel Dekker, 1988.
[26] G.J. McLachlan and T. Krishnan, The EM Algorithm and Extensions. John Wiley and Sons, 1997.
[27] C.V. Stewart, “MINPRAN: A New Robust Estimator for Computer Vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 10, pp. 925-938, Oct. 1995.
[28] E.C.K. Tsao, J.C. Bezdek, and N.R. Pal, Fuzzy Kohonen Clustering Net Works Pattern Recognition, vol. 27, pp. 757-764, 1994.
[29] K.L. Wu and M.S. Yang, Alternative c-Means Clustering Algorithms Pattern Recognition, vol. 35, pp. 2267-2278, 2002.
[30] X.L. Xie and G. Beni, A Validity Measure for Fuzzy Clustering IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, pp. 841-847, 1991.
[31] R.R. Yager and D.P. Filev, Approximate Clustering Via the Mountain Method IEEE Trans. Systems, Man and Cybernetics, vol. 24, pp. 1279-1284, 1994.
[32] M.S. Yang, A Survey of Fuzzy Clustering Mathematical and Computer Modelling, vol. 18, pp. 1-16, 1993.
[33] L.A. Zadeh, Similarity Relations and Fuzzy Orderings Information Sciences, vol. 3, pp. 177-200, 1971.
[34] X. Zhuang, T. Wang, and P. Zhang, A Highly Robust Estimator Through Partially Likelihood Function Modeling and Its Application in Computer Vision IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, pp. 19-35, 1992.

Index Terms:
Robust clustering algorithm, fuzzy clustering, alternating optimization algorithm, total similarity, noise.
Miin-Shen Yang, Kuo-Lung Wu, "A Similarity-Based Robust Clustering Method," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 4, pp. 434-448, April 2004, doi:10.1109/TPAMI.2004.1265860
Usage of this product signifies your acceptance of the Terms of Use.