Interval competitive agglomeration clustering algorithm

Expert Systems with Applications

Volumn 37, Issue 9, 2010, Pages 6567-6578

  Jeng, Jin Tsong ^b   Chuang, Chen Chia ^a   Tao, C W ^a  

^a NATIONAL ILAN UNIVERSITY   (Taiwan)

^b NATIONAL FORMOSA UNIVERSITY   (Taiwan)

Author keywords

Clustering algorithm; Fuzzy c means clustering algorithm; Interval competitive agglomeration; Symbolic interval values data

Indexed keywords

AGGLOMERATION; FUZZY CLUSTERING;

COMPETITIVE AGGLOMERATION CLUSTERING ALGORITHM; EUCLIDEAN DISTANCE MEASURE; FUZZY C-MEANS CLUSTERING ALGORITHMS; HIERARCHICAL CLUSTERING ALGORITHMS; NUMBER OF CLUSTERS; OPTIMAL PARTITIONS; PARTITIONAL CLUSTERING ALGORITHM; SYMBOLIC INTERVAL-VALUES DATA;

CLUSTERING ALGORITHMS;

EID: 77957834794     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.02.129     Document Type: Article

References (24)

1. Billard, L., & Diday, E. (2003). From the statistics of data to the statistics of knowledge: Symbolic data analysis. Journal of the American Statistical Association, 98(462), 470-487. (Pubitemid 36931569)
2. Bock, H. H. (2002). Clustering algorithms and Kohonen maps for symbolic data. Journal of the Japanese Society of Computational Statistics, 15, 1-13.
3. Bock, H. H., & Diday, E. (2000). Analysis of symbolic data: Exploratory methods for extracting statistical information from complex data. Springer-Verlag.
4. Chavent, M. (1998). A monothetic clustering method. Pattern Recognition Letter, 19, 989-996. (Pubitemid 128426763)
5. Chavent, M., & Lechevallier, Y. (2002). Dynamical clustering algorithm of interval data: Optimization of an adequacy criterion based on Hausdorff distance. In A. Sokolowski & H.-H. Bock (Eds.), Classification, clustering and data analysis (pp. 53-59). Heidelberg: Springer-Verlag.
6. De Carvalho, F. A. T. (2007). Fuzzy c-means clustering methods for symbolic interval data. Pattern Recognition Letter, 28(6), 423-437.
7. De Carvalho, F. A. T., Souza, R. M. C. R., Chavent, M., & Lechevallier, Y. (2006). Adaptive Hausdorff distances and dynamic clustering of symbolic data. Pattern Recognition Letter, 27(3), 167-179. (Pubitemid 41689830)
8. Diday, E., & Brito, P. (1989). Symbolic cluster analysis: Conceptual and numerical analysis of data. Springer-Verlag. pp. 5-84.
9. Frigui, H., & Krishnapuram, R. (1997). Clustering by competitive agglomeration. Pattern Recognition, 30(7), 1109-1119. (Pubitemid 127406518)
10. Gordon, A. D. (1999). Classification. CRC Press.
11. Gordon, A. D. (2000). An iterative relocation algorithm for classifying symbolic data. In W. Gaul et al. (Eds.), Data analysis: Scientific modeling and practical application (pp. 7-23). Springer-Verlag.
12. Gowda, K. C., & Diday, E. (1991). Symbolic clustering using a new dissimilarity measure. Pattern Recognition, 24(6), 567-578. (Pubitemid 21650079)
13. Gowda, K. C., & Diday, E. (1992). Symbolic clustering using a new similarity measure. IEEE Transactions on Systems Man Cybernetic, 22, 368-378.
14. Gowda, K. C., & Ravi, T. R. (1995a). Divisive clustering of symbolic objects using the concepts of both similarity and dissimilarity. Pattern Recognition, 28(8), 1277-1282.
15. Gowda, K. C., & Ravi, T. R. (1995b). Agglomerative clustering of symbolic objects using the concepts of both similarity and dissimilarity. Pattern Recognition Letter, 16, 647-652.
16. Gowda, K. C., & Ravi, T. R. (1999). Clustering of symbolic objects using gravitational approach. IEEE Transactions on Systems Man Cybernetic, 29(6), 888-894.
17. Guru, D. S., & Kiranagi, B. B. (2005). Multivalued type dissimilarity measure and concept of mutual dissimilarity value for clustering symbolic patterns. Pattern Recognition, 38, 151-256.
18. Guru, D. S., Kiranagi, B. B., & Nagabhushan, P. (2004). Multivalued type proximity measure and concept of mutual similarity value useful for clustering symbolic patterns. Pattern Recognition Letter, 25, 1203-1213. (Pubitemid 38763662)
19. Ichino, M., & Yaguchi, H. (1994). Generalized Minkowski metrics for mixed feature type data analysis. IEEE Transactions on Systems Man Cybernetic, 24(4), 698-708.
20. Jain, A. K., & Dubes, R. C. (1988). Algorithms for clustering data. Englewood Cliffs, New Jersey: Prentice-Hall.
21. Jain, A. K., Murty, M. N., & Flynn, P. J. (1999). Data clustering: A review. ACM Computing Surveys, 31(3), 264-323.
22. Ralambondrainy, H. (1995). A conceptual version of the k-means algorithm. Pattern Recognition Letter, 16, 1147-1157. (Pubitemid 26442196)
23. Souza, R. M. C. R., & De Carvalho, F. A. T. (2004). Clustering of interval data based on city-block distances. Pattern Recognition Letter, 25(3), 353-365. (Pubitemid 38062596)
24. Verde, R., De Carvalho, F. A. T., & Lechevallier, Y. (2001). A dynamical clustering algorithm for symbolic data. In Tutorial on symbolic data analysis held during the 25th annual conference of the Gesellschaft für Klassifikation e.V. University of Munich, March 13.