@InProceedings{MiquelFerrer2009,
author="Miquel Ferrer
and Ernest Valveny
and F. Serratosa
and I. Bardaji
and Horst Bunke",
title="Graph-based k-means clustering: A comparison of the set versus the generalized median graph",
booktitle="13th International Conference on Computer Analysis of Images and Patterns",
year="2009",
publisher="Springer Berlin Heidelberg",
volume="5702",
pages="342--350",
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.",
optnote="DAG",
optnote="exported from refbase (http://refbase.cvc.uab.es/show.php?record=1219), last updated on Tue, 17 Dec 2013 15:25:12 +0100",
isbn="978-3-642-03766-5",
issn="0302-9743",
doi="10.1007/978-3-642-03767-2_42"
}