A new greedy algorithm for improving b-coloring clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4538 LNCS, Issue , 2007, Pages 228-239

  Elghazel, Haytham ^a   Yoshida, Tetsuya ^b   Deslandres, Véronique ^a   Hacid, Mohand Said ^a   Dussauchoy, Alain ^a  

^a UNIVERSITÉ LYON 1   (France)

^b HOKKAIDO UNIVERSITY   (Japan)

Author keywords

Clustering; Graph b coloring; Graph re coloring

Indexed keywords

BENCHMARKING; GRAPH THEORY; IDENTIFICATION (CONTROL SYSTEMS); ROBUSTNESS (CONTROL SYSTEMS);

B-COLORING; DESIRABLE CLUSTERING; GREEDY ALGORITHMS;

CLUSTERING ALGORITHMS;

EID: 38149038714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72903-7_21     Document Type: Conference Paper

References (13)

1. Bezdek, J.C., Pal, N.R.: Some new indexes of cluster validity. IEEE Transactions on Systems, Man. and Cybernetics 28(3), 301-315 (1998)
2. Effantin, B., Kheddouci, H.: The b-chromatic number of some power graphs. Discrete Mathematics and Theoretical Computer Science 6(1), 45-54 (2003)
3. Elghazel, H., Deslandres, V., Hacid, M.S., Dussauchoy, A., Kheddouci, H.: A new clustering approach for symbolic data and its validation: Application to the healthcare data. In: Esposito, F., et al. (ed.) ISMIS 2006. LNCS (LNAI), vol. 4208, pp. 473-482. Springer Verlag, Heidelberg (2006)
4. Guënoche, A., Hansen, P., Jaumard, B.: Efficient algorithms for divisive hierarchical clustering with the diameter criterion. Journal of Classification 8, 5-30 (1991)
5. Guha, S., Rastogi, R., Shim, K.: Cure: An efficient clustering algorithm for large databases. In: Proceedings of the ACM SIGMOD Conference, pp. 73-84 (1998)
6. Hansen, P., Delattre, M.: Complete-link cluster analysis by graph coloring. Journal of the American Statistical Association 73, 397-403 (1978)
7. Hartigan, J., Wong, M.: Algorithm as136: A k-means clustering algorithm. Journal of Applied Statistics 28, 100-108 (1979)
8. Hettich, S., Blake, C.L., Merz, C.J.: Uci repository of machine learning databases (1998)
9. Irving, W., Manlov, D.F.: The b-chromatic number of a graph. Discrete Applied Mathematics 91, 127-141 (1999)
10. Jain, A.K., Murty, M.N.: Data clustering: A review. ACM Computing Surveys 31, 264-323 (1999)
11. Kalyani, M., Sushmita, M.: Clustering and its validation in a symbolic framework. Pattern Recognition Letters 24(14), 2367-2376 (2003)
12. Ng, R., Han, J.: Clarans: a method for clustering objects for spatial data mining. IEEE Transactions on Knowledge and Data. Engineering 14(5), 1003-1016 (2002)
13. ZAHN, C.T.: Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers 20, 68-86 (1971)