Extension to C-means algorithm for the use of similarity functions

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

Volumn 1704, Issue , 1999, Pages 354-359

  García Serrano, Javier Raymundo ^a   Martínez Trinidad, José Francisco ^b  

^a CENTRO NACIONAL DE INVESTIGACIÓN Y DESARROLLO TECNOLÓGICO   (Mexico)

^b INSTITUTO POLITÉCNICO NACIONAL   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING;

C-MEANS ALGORITHMS; MISSING DATA; OPTIMAL NUMBER; PARTIAL SIMILARITIES; PUBLIC DATABASE; QUALITATIVE FEATURES; SIMILARITY FUNCTIONS; SOFT SCIENCE;

C (PROGRAMMING LANGUAGE);

EID: 57649192979     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48247-5_42     Document Type: Conference Paper

References (7)

1. Richard O. Duda and Peter E. Hart. Pattern Classification and Scene Analysis. (USA, John Wiley & Sons, Inc. 1973.).
2. ftp://ftp.ics.uci.edu/pub/machine-learning-databases/.
3. H. Ralambondrainy, “A conceptual version of the K-means algorithm”. In: Pattern Recognition Letters 16, p. 1147-1157.
4. José Ruiz Shulcloper, et al. Introducción al reconocimiento de patrones (Enfoque Lógico Combinatorio) (Serie Verde No. 51, México, Depto. de Ingeniería Eléctrica, Sec. Computación CINVESTAV-IPN, 1995).
5. Ruspini, E. R. “A new approach to clustering” (En: Information and control, No. 15, 1969) p 22-32.
6. Robert J. Schalkoff. Pattern Recognition: Statistical, Structural and Neuronal Approaches (USA, John Wiley & Sons, Inc. 1992).
7. G. Ball and D. Hall, A Clustering technique for summarizing multivariate data, Behav. Sci., vol. 12, pp. 153-155, 1967.