Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph
verfasst von : M. Ferrer, E. Valveny, F. Serratosa, I. Bardají, H. Bunke
Erschienen in: Computer Analysis of Images and Patterns
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.