Generalized median graph computation by means of graph embedding in vector spaces

  • Authors:

  • M. Ferrer;E. Valveny;F. Serratosa;K. Riesen;H. Bunke

  • Affiliations:

  • Centre de Visió per Computador, Departament de Ciències de la Computació, Universitat Autònoma de Barcelona, 08193 Bellaterra, Spain;Centre de Visió per Computador, Departament de Ciències de la Computació, Universitat Autònoma de Barcelona, 08193 Bellaterra, Spain;Departament d'Enginyeria Informítica i Matemítiques, Universitat Rovira i Virgili, 43007 Tarragona, Spain;Institute of Computer Science and Applied Mathematics, University of Bern, Neubrückstrasse, 10, CH-3012 Bern, Switzerland;Institute of Computer Science and Applied Mathematics, University of Bern, Neubrückstrasse, 10, CH-3012 Bern, Switzerland

  • Venue:
  • Pattern Recognition
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

The median graph has been presented as a useful tool to represent a set of graphs. Nevertheless its computation is very complex and the existing algorithms are restricted to use limited amount of data. In this paper we propose a new approach for the computation of the median graph based on graph embedding. Graphs are embedded into a vector space and the median is computed in the vector domain. We have designed a procedure based on the weighted mean of a pair of graphs to go from the vector domain back to the graph domain in order to obtain a final approximation of the median graph. Experiments on three different databases containing large graphs show that we succeed to compute good approximations of the median graph. We have also applied the median graph to perform some basic classification tasks achieving reasonable good results. These experiments on real data open the door to the application of the median graph to a number of more complex machine learning algorithms where a representative of a set of graphs is needed.