Graph-based k-means clustering: A comparison of the set versus the generalized median graph

Consultar RECERCAT

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/7485

Título:	Graph-based k-means clustering: A comparison of the set versus the generalized median graph
Autor/a:	Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Bardaji Goikoetxea, Itziar; Bunke, Horst
Otros autores:	Institut de Robòtica i Informàtica Industrial; Universitat Politècnica de Catalunya. VIS - Visió Artificial i Sistemes Intel.ligents
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.
Abstract:	Peer Reviewed
Materia(s):	-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat -Algorithms and architectures for advanced scientific computing -Algorismes computacionals -- Processament de dades
Derechos:
Tipo de documento:	Artículo - Versión publicada Capítulo o parte de libro
Editor:	Springer Berlin / Heidelberg
Compartir:

Ferrer Sumsi, Miquel; Karatzas, D; Valveny, Ernest; Bardaji Goikoetxea, Itziar; Bunke, Horst

Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst

Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst

Ferrer Sumsi, Miquel; Valveny, Ernest; Bunke, Horst

Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc

Coordinación

Patrocinio