|   | 
Details
   web
Record
Author (up) Miquel Ferrer; Ernest Valveny; F. Serratosa; I. Bardaji; Horst Bunke
Title Graph-based k-means clustering: A comparison of the set versus the generalized median graph Type Conference Article
Year 2009 Publication 13th International Conference on Computer Analysis of Images and Patterns Abbreviated Journal
Volume 5702 Issue Pages 342–350
Keywords
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.
Address Münster, Germany
Corporate Author Thesis
Publisher Springer Berlin Heidelberg Place of Publication Editor
Language Summary Language Original Title
Series Editor Series Title Abbreviated Series Title LNCS
Series Volume Series Issue Edition
ISSN 0302-9743 ISBN 978-3-642-03766-5 Medium
Area Expedition Conference CAIP
Notes DAG Approved no
Call Number DAG @ dag @ FVS2009d Serial 1219
Permanent link to this record