Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30134
Share/Impact:
Título : Graph-based k-means clustering: A comparison of the set versus the generalized median graph
Autor : Ferrer, Miquel, Valveny, Ernest, Serratosa, Francesc, Bardaji, I., Bunke, Horst
Palabras clave : Graph matching
Median graph
Clustering
Fecha de publicación : 2009
Editor: Springer
Citación : Lecture Notes in Computer Science 5702
Resumen: 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.
Descripción : Trabajo presentado al 13th CAIP celebrado en Alemania del 2 al 4 de septiembre de 2009.
Versión del editor: http://dx.doi.org/10.1007/978-3-642-03767-2_42
URI : http://hdl.handle.net/10261/30134
ISBN : 978-3-642-03766-5
DOI: 10.1007/978-3-642-03767-2_42
Citación : Computer Analysis of Images and Patterns: 342-350 (2009)
Appears in Collections:(IRII) Libros y partes de libros

Files in This Item:
File Description SizeFormat 
Graph-based k-means.pdf276,54 kBAdobe PDFView/Open
Show full item record
 
CSIC SFX LinksSFX Query

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