Abstract
In the recent years, Graph Edit Distance has awaken interest in the scientific community and some new graph-matching algorithms that compute it have been presented. Nevertheless, these algorithms usually cannot be used in real applications due to runtime restrictions. For this reason, other graph-matching algorithms have also been used that compute an approximation of the graph correspondence with lower runtime. Clearly, in a real application, there is a tradeoff between runtime and accuracy. One of the most costly part in these algorithms is the deduction of the node-to-node mapping. We present a new graph-matching algorithm that returns a graph correspondence without the explicit computation of the assignment problem. This is done thanks to a classification of the node-to-node assignment learned in a previous training stage.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognit. Artif. Intell. 18(03), 265–298 (2004)
Livi, L., Rizzi, A.: The graph matching problem. Pattern Anal. Appl. 16(3), 253–283 (2013)
Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recognit. Artif. Intell. 28(01), 1450001 (2014)
Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Anal. Appl. 13(1), 113–129 (2010)
Serratosa, F.: Graph edit distance: restrictions to be a metric. Pattern Recognit. 90, 250–256 (2019)
Santacruz, P., Serratosa, F.: Learning the sub-optimal graph edit distance edit costs based on an embedded model. In: Bai, X., Hancock, E.R., Ho, T.K., Wilson, R.C., Biggio, B., Robles-Kelly, A. (eds.) S+SSPR 2018. LNCS, vol. 11004, pp. 282–292. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-97785-0_27
Cortés, X., Conte, D., Cardot, H., Serratosa, F.: A deep neural network architecture to estimate node assignment costs for the graph edit distance. In: Bai, X., Hancock, E.R., Ho, T.K., Wilson, R.C., Biggio, B., Robles-Kelly, A. (eds.) S+SSPR 2018. LNCS, vol. 11004, pp. 326–336. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-97785-0_31
Fischer, A., Riesen, K., Bunke, H.: Improved quadratic time approximation of graph edit distance by combining hausdorff matching and greedy assignment. Pattern Recognit. Lett. 87, 55–62 (2017)
Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(7), 950–959 (2009)
Serratosa, F., Cortés, X.: Interactive graph-matching using active query strategies. Pattern Recognit. 48(4), 1364–1373 (2015)
Ferrer, M., Serratosa, F., Riesen, K.: Improving bipartite graph matching by assessing the assignment confidence. Pattern Recognit. Lett. 65, 29–36 (2015)
Serratosa, F.: Speeding up fast bipartite graph matching through a new cost matrix. Int. J. Pattern Recognit. Artif. Intell. 29(02), 1550010 (2015)
Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32–38 (1957)
Cortés, X., Serratosa, F., Riesen, K.: On the relevance of local neighbourhoods for greedy graph edit distance. In: Robles-Kelly, A., Loog, M., Biggio, B., Escolano, F., Wilson, R. (eds.) S+SSPR 2016. LNCS, vol. 10029, pp. 121–131. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49055-7_11
Serratosa, F., Cortés, X.: Graph edit distance: moving from global to local structure to solve the graph-matching problem. Pattern Recognit. Lett. 65, 204–210 (2015)
Fischer, A., Riesen, K., Horst, B.: Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment. Pattern Recognit. Lett. 87, 55–62 (2017)
Riesen, K., Ferrer, M., Dornberger, R., Bunke, H.: Greedy graph edit distance. In: Perner, P. (ed.) MLDM 2015. LNCS (LNAI), vol. 9166, pp. 3–16. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21024-7_1
Serratosa, F.: Fast computation of bipartite graph matching. Pattern Recognit. Lett. 45, 244–250 (2014)
Jonker, R., Volgenant, T.: Improving the Hungarian assignment algorithm. Oper. Res. Lett. 5(4), 171–175 (1986)
Caetano, T.S., McAuley, J.J., Cheng, L., Le, Q.V., Smola, A.J.: Learning graph matching. IEEE Trans. PAMI 31(6), 1048–1058 (2009)
Leordeanu, M., Sukthankar, R., Hebert, M.: Unsupervised learning for graph matching. Int. J. Comput. Vis. 96(1), 28–45 (2012)
Cortés, X., Serratosa, F.: Learning graph-matching edit-costs based on the optimality of the Oracle’s node correspondences. Pattern Recognit. Lett. 56, 22–29 (2015)
Cortés, X., Serratosa, F.: Learning graph matching substitution weights based on the ground truth node correspondence. IJPRAI 30(02), 1650005 (2016)
Algabli, S., Serratosa, F.: Embedding the node-to-node mappings to learn the graph edit distance parameters. Pattern Recognit. Lett. 112, 353–360 (2018)
Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Inf. Sci. 177(1), 239–247 (2007)
Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Trans. SMC, Part B 35(3), 503–514 (2005)
Dunn, J.C.: Well-separated clusters and optimal fuzzy partitions. J. Cybern. 4(1), 95–104 (1974)
Moreno-García, C.F., Cortés, X., Serratosa, F.: A graph repository for learning error-tolerant graph matching. In: Proceedings of SSPR (2016)
Serratosa, F.: A methodology to generate attributed graphs with a bounded graph edit distance for graph-matching testing. IJPRAI 32(11), 1850038 (2018)
Acknowledgements
This research is supported by projects TIN2016-77836-C2-1-R and DPI2016-78957-R and AEROARMS (H2020-ICT-2014-1-644271 (Spain), and by DANIEAL2 project of Centre-Val-de-Loire Region (France).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Cortés, X., Conte, D., Serratosa, F. (2019). Sub-optimal Graph Matching by Node-to-Node Assignment Classification. In: Conte, D., Ramel, JY., Foggia, P. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2019. Lecture Notes in Computer Science(), vol 11510. Springer, Cham. https://doi.org/10.1007/978-3-030-20081-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-20081-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20080-0
Online ISBN: 978-3-030-20081-7
eBook Packages: Computer ScienceComputer Science (R0)