Graph clustering using the weighted minimum common supergraph

  • Authors:
  • Horst Bunke;P. Foggia;C. Guidobaldi;M. Vento

  • Affiliations:
  • Institut für Informatik und angwandte Mathematik, Universität Bern, Bern, Switzerland;Dipartimento di Informatica e Sistemistica, Università di Napoli “Federico II”, Napoli, Italy;Dipartimento di Informatica e Sistemistica, Università di Napoli “Federico II”, Napoli, Italy;Dipartimento di Ingegneria dell'Informazione ed Ingegneria Elettrica, Università di Salerno, Fisciano, SA, Italy

  • Venue:
  • GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Graphs are a powerful and versatile tool useful for representing patterns in various subfields of science and engineering. In many applications, for example, in pattern recognition and computer vision, it is required to measure the similarity of objects for clustering similar patterns. In this paper a new structural method, the Weighted Minimum Common Supergraph (WMCS), for representing a cluster of patterns is proposed. Using this method it becomes easy to extract the common information shared in the patterns of a cluster and separate this information from noise and distortions that usually affect graphs representing real objects. Moreover, experimental results show that WMCS is suitable for performing graph clustering.