%0 Conference Proceedings
%T Graph-based k-means clustering: A comparison of the set versus the generalized median graph
%A Miquel Ferrer
%A Ernest Valveny
%A F. Serratosa
%A I. Bardaji
%A Horst Bunke
%B 13th International Conference on Computer Analysis of Images and Patterns
%D 2009
%V 5702
%I Springer Berlin Heidelberg
%@ 0302-9743
%@ 978-3-642-03766-5
%F Miquel Ferrer2009
%O DAG
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=1219), last updated on Tue, 17 Dec 2013 15:25:12 +0100
%X 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.
%U http://dx.doi.org/10.1007/978-3-642-03767-2_42
%P 342–350