PT Unknown
AU Miquel Ferrer
   Ernest Valveny
   F. Serratosa
   I. Bardaji
   Horst Bunke
TI Graph-based k-means clustering: A comparison of the set versus the generalized median graph
BT 13th International Conference on Computer Analysis of Images and Patterns
PY 2009
BP 342–350
VL 5702
DI 10.1007/978-3-642-03767-2_42
AB 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.
ER