Median graphs: A genetic approach based on new theoretical properties

Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present two major contributions. On one side, and from a theoretical point of view, we show new theoretical properties of the median graph. On the other side, using these new properties, we present a new approximate algorithm based on the genetic search, that improves the computation of the median graph. Finally, we perform a set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity. With these results, we show how the concept of the median graph can be used in real applications and leaves the box of the only-theoretical concepts, demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs.

[1]  Ernest Valveny,et al.  Spectral Median Graphs Applied to Graphical Symbol Recognition , 2006, CIARP.

[2]  Horst Bunke,et al.  A Quadratic Programming Approach to the Graph Edit Distance Problem , 2007, GbRPR.

[3]  Ernest Valveny,et al.  On the Relation Between the Median and the Maximum Common Subgraph of a Set of Graphs , 2007, GbRPR.

[4]  Abraham Kandel,et al.  On the Minimum Common Supergraph of Two Graphs , 2000, Computing.

[5]  T. B. Boffey,et al.  Applied Graph Theory , 1973 .

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

[7]  Yu Wang,et al.  A novel efficient algorithm for determining maximum common subgraphs , 2005, Ninth International Conference on Information Visualisation (IV'05).

[8]  Horst Bunke,et al.  Graph Clustering Using the Weighted Minimum Common Supergraph , 2003, GbRPR.

[9]  Gabriel Valiente,et al.  A graph distance metric combining maximum common subgraph and minimum common supergraph , 2001, Pattern Recognit. Lett..

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

[11]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

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

[13]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[14]  Dit-Yan Yeung,et al.  Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshops, SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, ... (Lecture Notes in Computer Science) , 2006 .

[15]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[16]  Horst Bunke,et al.  Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..

[17]  Ernest Valveny,et al.  Median graph: A new exact algorithm using a distance based on the maximum common subgraph , 2009, Pattern Recognit. Lett..

[18]  Richard C. Wilson,et al.  Mixing spectral representations of graphs , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[19]  Kuo-Chin Fan,et al.  Genetic-based search for error-correcting graph isomorphism , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[20]  Alberto Sanfeliu,et al.  Synthesis of Median Spectral Graph , 2005, IbPRIA.

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

[22]  Horst Bunke,et al.  On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..

[23]  Edwin R. Hancock,et al.  Inexact graph matching using genetic search , 1997, Pattern Recognit..

[24]  Shengrui Wang,et al.  A New Median Graph Algorithm , 2003, GbRPR.

[25]  Robert Hecht Nielsen,et al.  Applied Graph Theory in Computer Vision and Pattern Recognition , 2007, Studies in Computational Intelligence.

[26]  Abraham Kandel,et al.  Graph-Theoretic Techniques for Web Content Mining , 2005, Series in Machine Perception and Artificial Intelligence.

[27]  E. Hancock,et al.  Graph Based Representations in Pattern Recognition: 4th IAPR International Workshop, GbRPR 2003, York, UK, June 30 - July 2, 2003. Proceedings , 2003 .

[28]  Ernest Valveny,et al.  Bounding the Size of the Median Graph , 2007, IbPRIA.

[29]  Horst Bunke,et al.  Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem , 1999, Pattern Recognit. Lett..

[30]  Horst Bunke,et al.  A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs , 2002, SSPR/SPR.

[31]  Horst Bunke,et al.  Synthesis of Representative Graphical Symbols by Computing Generalized Median Graph , 1999, GREC.

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

[33]  Mario Vento,et al.  Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs , 2007, J. Graph Algorithms Appl..

[34]  A. Paone,et al.  Discrete Time Relaxation Based on Direct Quadrature Methods for Volterra Integral Equations , 1999, Computing.

[35]  J. J. McGregor,et al.  Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..

[36]  Abraham Kandel,et al.  Applied Graph Theory in Computer Vision and Pattern Recognition , 2007 .

[37]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[38]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.