Interval competitive agglomeration clustering algorithm

1 In this study, a novel robust clustering algorithm, robust interval competitive agglomeration (RICA) clustering algorithm, is proposed to overcome the problems of the outliers, the numbers of cluster and the initialization of prototype in the fuzzy C-means (FCM) clustering algorithm for the symbolic interval-values data. In the proposed RICA clustering algorithm, the Euclidean distance measure is considered. Due to the competitive agglomeration is used, the RICA clustering algorithm can be fast converges in a few iterations and to the same optimal partition regardless of its initialization of prototype. Experimentally results show the merits and usefulness of the RICA clustering algorithm for the symbolic interval-values data with outliers.

• Type: Journal
• Year: 2010
• Where: ESWA
• Authors: Jin-Tsong Jeng, Chen-Chia Chuang, Chin-Wang Tao
• Keywords: Algorithm, Competitive Agglomeration, ESWA 2010, Robust Clustering Algorithm, Software Engineering