TY  - CONF
AU  - Miquel Ferrer
AU  - Ernest Valveny
AU  - F. Serratosa
AU  - I. Bardaji
AU  - Horst Bunke
A2  - CAIP
PY  - 2009//
TI  - Graph-based k-means clustering: A comparison of the set versus the generalized median graph
T2  - LNCS
BT  - 13th International Conference on Computer Analysis of Images and Patterns
SP  - 342–350
VL  - 5702
PB  - Springer Berlin Heidelberg
N2  - 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.
SN  - 0302-9743
SN  - 978-3-642-03766-5
UR  - http://dx.doi.org/10.1007/978-3-642-03767-2_42
N1  - DAG
ID  - Miquel Ferrer2009
ER  -