Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph

  • M. Ferrer
  • E. Valveny
  • F. Serratosa
  • I. Bardají
  • H. Bunke
Conference paper

DOI: 10.1007/978-3-642-03767-2_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5702)
Cite this paper as:
Ferrer M., Valveny E., Serratosa F., Bardají I., Bunke H. (2009) Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph. In: Jiang X., Petkov N. (eds) Computer Analysis of Images and Patterns. CAIP 2009. Lecture Notes in Computer Science, vol 5702. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • M. Ferrer
    • 1
  • E. Valveny
    • 2
  • F. Serratosa
    • 3
  • I. Bardají
    • 1
  • H. Bunke
    • 4
  1. 1.Institut de Robòtica i Informàtica Industrial, CSIC-UPCBarcelonaSpain
  2. 2.Centre de Visió per ComputadorUniversitat Autònoma de BarcelonaBellaterraSpain
  3. 3.Departament d’Informàtica i MatemàtiquesUniversitat Rovira i VirgiliTarragonaSpain
  4. 4.Institute of Computer Science and Applied MathematicsUniversity of BernBernSwitzerland

Personalised recommendations