Advertisement

BFST_ED: A Novel Upper Bound Computation Framework for the Graph Edit Distance

  • Karam GoudaEmail author
  • Mona Arafa
  • Toon Calders
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9939)

Abstract

Graph similarity is an important operation with many applications. In this paper we are interested in graph edit similarity computation. Due to the hardness of the problem, it is too hard to exactly compare large graphs, and fast approximation approaches with high quality become very interesting. In this paper we introduce a novel upper bound computation framework for the graph edit distance. The basic idea of this approach is to picture the comparing graphs into hierarchical structures. This view facilitates easy comparison and graph mapping construction. Specifically, a hierarchical view based on a breadth first search tree with its backward edges is used. A novel tree traversing and matching method is developed to build a graph mapping. The idea of spare trees is introduced to minimize the number of insertions and/or deletions incurred by the method and a lookahead strategy is used to enhance the vertex matching process. An interesting feature of the method is that it combines vertex map construction with edit counting in an easy and straightforward manner. This framework also allows to compare graphs from different hierarchical views to improve the upper bound. Experiments show that tighter upper bounds are always delivered by this new framework at a very good response time.

Keywords

Graph similarity Graph edit distance Upper bounds 

References

  1. 1.
    Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. 18, 265–298 (2004)CrossRefGoogle Scholar
  2. 2.
    Fischer, A., Suen, C., Frinken, V., Riesen, K., Bunke, H.: Approximation of graph edit distance based on hausdorff matching. Pattern Recogn. 48(2), 331–343 (2015)CrossRefGoogle Scholar
  3. 3.
    Gaüzère, B., Bougleux, S., Riesen, K., Brun, L.: Approximate graph edit distance guided by bipartite matching of bags of walks. In: Fränti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 73–82. Springer, Heidelberg (2014)Google Scholar
  4. 4.
    Gouda, K., Arafa, M.: An improved global lower bound for graph edit similarity search. Pattern Recogn. Lett. 58, 8–14 (2015)CrossRefGoogle Scholar
  5. 5.
    Gouda, K., Hassaan, M.: CSI_GED: an efficient approach for graph edit similarity computation. In: ICDE, pp. 265–276 (2016)Google Scholar
  6. 6.
    Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. SSC 4(2), 100–107 (1968)Google Scholar
  7. 7.
    Justice, D., Hero, A.: A binary linear programming formulation of the graph edit distance. IEEE Trans. PAMI 28(8), 1200–1214 (2006)CrossRefGoogle Scholar
  8. 8.
    Munkres, J.: A network view of disease and compound screening. J. Soc. Ind. Appl. Math. 5, 32–38 (1957)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Neuhaus, M., Bunke, H.: Edit distance-based kernel functions for structural pattern classification. Pattern Recogn. 39, 1852–1863 (2006)CrossRefzbMATHGoogle Scholar
  10. 10.
    Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(7), 950–959 (2009)CrossRefGoogle Scholar
  11. 11.
    Riesen, K., Fischer, A., Bunke, H.: Computing upper and lower bounds of graph edit distance in cubic time. In: El Gayar, N., Schwenker, F., Suen, C. (eds.) ANNPR 2014. LNCS, vol. 8774, pp. 129–140. Springer, Heidelberg (2014)Google Scholar
  12. 12.
    Riesen, K., Emmenegger, S., Bunke, H.: A novel software toolkit for graph edit distance computation. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol. 7877, pp. 142–151. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  13. 13.
    Riesen, K., Fankhauser, S., Bunke, H.: Speeding up graph edit distance computation with a bipartite heuristic. In: MLG, pp. 21–24 (2007)Google Scholar
  14. 14.
    Riesen, K., Neuhaus, M., Bunke, H.: Bipartite graph matching for computing the edit distance of graphs. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol. 4538, pp. 1–12. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Serratosa, F.: Fast computation of bipartite graph matching. Pattern Recogn. Lett. 45, 244–250 (2014)CrossRefGoogle Scholar
  16. 16.
    Zeng, Z., Tung, A., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. PVLDB 2(1), 25–36 (2009)Google Scholar
  17. 17.
    Zhao, X., Xiao, C., Lin, X., Wang, W., Ishikawa, Y.: Efficient processing of graph similarity queries with edit distance constraints. VLDB J. 22, 727–752 (2013)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Faculty of Computers and Informatics, Benha UniversityBenhaEgypt
  2. 2.Computer and Decision Engineering DepartmentUniversit Libre de BruxellesBrusselsBelgium

Personalised recommendations