Robust clustering algorithm for the symbolic interval-values data with outliers

In this study, the novel robust clustering algorithm, robust interval competitive agglomeration (RICA) clustering algorithm, is proposed to overcome the problems of the outliers and the numbers of cluster in the competitive agglomeration clustering algorithm for the symbolic interval-values data. The Euclidean distance measure is considered in the proposed RICA clustering algorithm. Moreover, the RICA clustering algorithm can be fast converges in a few iterations regardless of the initial number of clusters. Additionally, the RICA clustering algorithm is also converges to the same optimal partition regardless of its initialization. Experimentally results show the merits and usefulness of the RICA clustering algorithm for the symbolic interval-values data.

[1]  K. Chidananda Gowda,et al.  Divisive clustering of symbolic objects using the concepts of both similarity and dissimilarity , 1995, Pattern Recognit..

[2]  Hans-Hermann Bock.  CLUSTERING ALGORITHMS AND KOHONEN MAPS FOR SYMBOLIC DATA(Symbolic Data Analysis) , 2003 .

[3]  Takayuki Saito,et al.  CIRCLE STRUCTURE DERIVED FROM DECOMPOSITION OF ASYMMETRIC DATA MATRIX , 2002 .

[4]  Francisco de A. T. de Carvalho,et al.  Clustering of interval data based on city-block distances , 2004, Pattern Recognit. Lett..

[5]  K. Chidananda Gowda,et al.  Clustering of symbolic objects using gravitational approach , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[6]  L. Billard,et al.  From the Statistics of Data to the Statistics of Knowledge , 2003 .

[7]  Rajesh N. Davé,et al.  Robust clustering methods: a unified view , 1997, IEEE Trans. Fuzzy Syst..

[8]  D. S. Guru,et al.  Multivalued type dissimilarity measure and concept of mutual dissimilarity value for clustering symbolic patterns , 2005, Pattern Recognit..

[9]  Sudipto Guha,et al.  ROCK: A Robust Clustering Algorithm for Categorical Attributes , 2000, Inf. Syst..

[10]  K. Chidananda Gowda,et al.  Symbolic clustering using a new similarity measure , 1992, IEEE Trans. Syst. Man Cybern..

[11]  Manabu Ichino,et al.  Generalized Minkowski metrics for mixed feature-type data analysis , 1994, IEEE Trans. Syst. Man Cybern..

[12]  Yves Lechevallier,et al.  Dynamical Clustering of Interval Data: Optimization of an Adequacy Criterion Based on Hausdorff Distance , 2002 .

[13]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[14]  J. William Ahwood,et al.  CLASSIFICATION , 1931, Foundations of Familiar Language.

[15]  Hans-Hermann Bock,et al.  Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data , 2000 .

[16]  P. Nagabhushan,et al.  Multivalued type proximity measure and concept of mutual similarity value useful for clustering symbolic patterns , 2004, Pattern Recognit. Lett..

[17]  Edwin Diday,et al.  Symbolic clustering using a new dissimilarity measure , 1991, Pattern Recognit..

[18]  Hichem Frigui,et al.  A Robust Competitive Clustering Algorithm With Applications in Computer Vision , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Allan D. Gordon,et al.  An Iterative Relocation Algorithm for Classifying Symbolic Data , 2000 .

[20]  Edwin Diday,et al.  Symbolic Cluster Analysis , 1989 .

[21]  Marie Chavent,et al.  A monothetic clustering method , 1998, Pattern Recognit. Lett..

[22]  Yves Lechevallier,et al.  Adaptive Hausdorff distances and dynamic clustering of symbolic interval data , 2006, Pattern Recognit. Lett..

[23]  H. Ralambondrainy,et al.  A conceptual version of the K-means algorithm , 1995, Pattern Recognit. Lett..

[24]  K. Chidananda Gowda,et al.  Agglomerative clustering of symbolic objects using the concepts of both similarity and dissimilarity , 1995, Pattern Recognit. Lett..