A Comparison between Two Representatives of a Set of Graphs: Median vs. Barycenter Graph

In this paper we consider two existing methods to generate a representative of a given set of graphs, that satisfy the following two conditions. On the one hand, that they are applicable to graphs with any kind of labels in nodes and edges and on the other hand, that they can handle relatively large amount of data. Namely, the approximated algorithms to compute the Median Graph via graph embedding and a new method to compute the Barycenter Graph. Our contribution is to give a new algorithm for the barycenter computation and to compare it to the median Graph. To compare these two representatives, we take into account algorithmic considerations and experimental results on the quality of the representative and its robustness, on several datasets.

[1]  I. Goikoetxea.  Graph representatives: two different approaches based on the median and the barycenter concepts , 2009 .

[2]  Chandrajit L. Bajaj,et al.  The algebraic degree of geometric optimization problems , 1988, Discret. Comput. Geom..

[3]  Andrew K. C. Wong,et al.  Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Kaspar Riesen,et al.  Bipartite Graph Matching for Computing the Edit Distance of Graphs , 2007, GbRPR.

[5]  Francisco Escolano,et al.  Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Proceedings , 2007, GbRPR.

[6]  Ernest Valveny,et al.  Generalized median graph computation by means of graph embedding in vector spaces , 2010, Pattern Recognit..

[7]  Mario Vento,et al.  Learning structural shape descriptions from examples , 2002, Pattern Recognit. Lett..

[8]  Kaspar Riesen,et al.  Fast Suboptimal Algorithms for the Computation of Graph Edit Distance , 2006, SSPR/SPR.

[9]  M. Shirosaki.  Another proof of the defect relation for moving targets , 1991 .

[10]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  Ernest Valveny,et al.  A Recursive Embedding Approach to Median Graph Computation , 2009, GbRPR.

[12]  Klaus Obermayer,et al.  On the sample mean of graphs , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[13]  Kaspar Riesen,et al.  IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning , 2008, SSPR/SPR.

[14]  Alberto Sanfeliu,et al.  Estimating the Joint Probability Distribution of Random Vertices and Arcs by Means of Second-Order Random Graphs , 2002, SSPR/SPR.

[15]  Shengrui Wang,et al.  Median graph computation for graph clustering , 2006, Soft Comput..

[16]  Horst Bunke,et al.  Weighted Mean of a Pair of Graphs , 2001, Computing.

[17]  Horst Bunke,et al.  On Median Graphs: Properties, Algorithms, and Applications , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Kaspar Riesen,et al.  Graph Embedding in Vector Spaces by Means of Prototype Selection , 2007, GbRPR.

[19]  Edwin R. Hancock,et al.  Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop, SSPR&SPR 2010, Cesme, Izmir, Turkey, August 18-20, 2010. Proceedings , 2010, SSPR/SPR.

[20]  Alberto Sanfeliu,et al.  Function-described graphs for modelling objects represented by sets of attributed graphs , 2003, Pattern Recognit..

[21]  Alberto Sanfeliu,et al.  Synthesis of Function-Described Graphs and Clustering of Attributed Graphs , 2002, Int. J. Pattern Recognit. Artif. Intell..