A partially dynamic clustering algorithm for data insertion and removal

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

Volumn 4755 LNAI, Issue , 2007, Pages 78-90

  Elghazel, Haytham ^a   Kheddouci, Hamamache ^a   Deslandres, Véronique ^a   Dussauchoy, Alain ^a  

^a UNIVERSITÉ LYON 1   (France)

Author keywords

Dissimilarity; Dominance; Dynamic clustering; Graph b coloring

Indexed keywords

BENCHMARKING; CLASSIFICATION (OF INFORMATION); CONTEXT SENSITIVE GRAMMARS; DYNAMIC PROGRAMMING; PROBLEM SOLVING; WEB SERVICES;

BENCHMARK DATA SETS; DYNAMIC CLUSTERING ALGORITHMS; GRAPH B-COLORING; WEB DOCUMENTS CLASSIFICATION;

CLUSTERING ALGORITHMS;

EID: 38149011502     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75488-6_9     Document Type: Conference Paper

References (6)

1. Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys 31, 264-323 (1999)
2. Elghazel, H., et al.: A new clustering approach for symbolic data and its validation: Application to the healthcare data. In: Esposito, F., Ras, Z.W., Malerba, D., Semeraro, G. (eds.) ISMIS 2006. LNCS (LNAI), vol. 4203, pp. 473-182. Springer, Heidelberg (2006)
3. Irving, W., Manlove, D.F.: The b-chromatic number of a graph. Discrete Applied Mathematics 91, 127-141 (1999)
4. Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Transactions on Information Theory 13(1), 21-27 (1967)
5. Kalyani, M., Sushmita, M.: Clustering and its validation in a symbolic framework. Pattern Recognition Letters 24(14), 2367-2376 (2003)
6. Blake, C.L., Merz, C.J.: UCI repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Sciences (1998), http://www.ics.uci.edu/mlearn/MLRepository.html