Computing the Barycenter Graph by Means of the Graph Edit Distance


The barycenter graph has been shown as an alternative to obtain the representative of a given set of graphs. In this paper we propose an extension of the original algorithm which makes use of the graph edit distance in conjunction with the weighted mean of a pair of graphs. Our main contribution is that we can apply the method to attributed graphs with any kind of labels in both the nodes and the edges, equipped with a distance function less constrained than in previous approaches. Experiments done on four different datasets support the validity of the method giving good approximations of the barycenter graph.

DOI: 10.1109/ICPR.2010.241

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{Bardaj2010ComputingTB, title={Computing the Barycenter Graph by Means of the Graph Edit Distance}, author={Itziar Bardaj{\'i} and Miquel Ferrer and Alberto Sanfeliu}, booktitle={ICPR}, year={2010} }