English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30134
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:


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

AuthorsFerrer, Miquel CSIC ORCID; Valveny, Ernest; Serratosa, Francesc; Bardaji, I.; Bunke, Horst
KeywordsGraph matching
Median graph
Issue Date2009
CitationComputer Analysis of Images and Patterns: 342-350 (2009)
SeriesLecture Notes in Computer Science 5702
AbstractIn 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.
DescriptionTrabajo 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
Files in This Item:
File Description SizeFormat 
Graph-based k-means.pdf276,54 kBAdobe PDFThumbnail
Show full item record
Review this work

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