A Recursive Embedding Approach to Median Graph Computation

Authors:
M. Ferrer;D. Karatzas;E. Valveny;H. Bunke
Affiliations:
Institut de Robòtica i Informàtica Industrial, UPC-CSIC, Barcelona, Spain 08028;Centre de Visió per Computador, Universitat Autònoma de Barcelona, Bellaterra, Spain 08193;Centre de Visió per Computador, Universitat Autònoma de Barcelona, Bellaterra, Spain 08193;Institute of Computer Science and Applied Mathematics, University of Bern, Bern, Switzerland CH-3012
Venue:
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Year:
2009

Citing 10
Cited 2

On Median Graphs: Properties, Algorithms, and Applications

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Weighted mean of a pair of graphs

Computing
Median graph computation for graph clustering

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Graph-Theoretic Techniques for Web Content Mining

Graph-Theoretic Techniques for Web Content Mining
Mixing spectral representations of graphs

ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 04
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning

SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Bipartite graph matching for computing the edit distance of graphs

GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Graph embedding in vector spaces by means of prototype selection

GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Fast suboptimal algorithms for the computation of graph edit distance

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Synthesis of median spectral graph

IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II

A comparison between two representatives of a set of graphs: median vs. barycenter graph

SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
A generic framework for median graph computation based on a recursive embedding approach

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.00

Visualization

Abstract

The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches.