The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2004 vol.26)
pp: 434-448
ABSTRACT
<p><b>Abstract</b>—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.</p>
INDEX TERMS
Robust clustering algorithm, fuzzy clustering, alternating optimization algorithm, total similarity, noise.
CITATION
Miin-Shen Yang, "A Similarity-Based Robust Clustering Method", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.26, no. 4, pp. 434-448, April 2004, doi:10.1109/TPAMI.2004.1265860
188 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool