Digital.CSIC > Ciencia y Tecnologías Físicas > Instituto de Robótica e Informática Industrial (IRII) > (IRII) Libros y partes de libros >




Open Access item Graph-based k-means clustering: A comparison of the set versus the generalized median graph

Authors:Ferrer, Miquel
Valveny, Ernest
Serratosa, Francesc
Bardaji, I.
Bunke, Horst
Keywords:Graph matching, Median graph, Clustering
Issue Date:2009
Citation:Computer Analysis of Images and Patterns: 342-350 (2009)
Series/Report no.:Lecture Notes in Computer Science 5702
Abstract:In this paper we propose the application of the generalized median graph in a graph-based k-means clustering algorithm. In the graph-based k-means algorithm, the centers of the clusters have been traditionally represented using the set median graph. We propose an approximate method for the generalized median graph computation that allows to use it to represent the centers of the clusters. Experiments on three databases show that using the generalized median graph as the clusters representative yields better results than the set median graph.
Description:Trabajo presentado al 13th CAIP celebrado en Alemania del 2 al 4 de septiembre de 2009.
Publisher version (URL):http://dx.doi.org/10.1007/978-3-642-03767-2_42
Appears in Collections:(IRII) Libros y partes de libros

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.