{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:48:48Z","timestamp":1742942928946,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319977843"},{"type":"electronic","value":"9783319977850"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97785-0_32","type":"book-chapter","created":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T14:49:17Z","timestamp":1533134957000},"page":"337-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Error-Tolerant Geometric Graph Similarity"],"prefix":"10.1007","author":[{"given":"Shri Prakash","family":"Dwivedi","sequence":"first","affiliation":[]},{"given":"Ravi Shankar","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,2]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Armiti, A., Gertz, M.: Geometric graph matching and similarity: a probabilistic approach. In: SSDBM (2014)","DOI":"10.1145\/2618243.2618259"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0033223","volume-title":"Advances in Pattern Recognition","author":"H Bunke","year":"1998","unstructured":"Bunke, H.: Error-tolerant graph matching: a formal framework and algorithms. In: Amin, A., Dori, D., Pudil, P., Freeman, H. (eds.) SSPR\/SPR 1998. LNCS, vol. 1451, pp. 1\u201314. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0033223"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H Bunke","year":"1983","unstructured":"Bunke, H., Allerman, G.: Inexact graph matching for structural pattern recognition. Pattern Recogn. Lett. 1, 245\u2013253 (1983)","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"32_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1142\/S0218001404003186","volume":"18","author":"T Caelli","year":"2004","unstructured":"Caelli, T., Kosinov, S.: Inexact graph matching using eigen-subspace projection clustering. Int. J. Pattern Recogn. Artif. Intell. 18(3), 329\u2013355 (2004)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-02011-7_11","volume-title":"Experimental Algorithms","author":"O Cheong","year":"2009","unstructured":"Cheong, O., Gudmundsson, J., Kim, H.-S., Schymura, D., Stehn, F.: Measuring the similarity of geometric graphs. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 101\u2013112. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02011-7_11"},{"issue":"3","key":"32_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Dwivedi, S.P., Singh, R.S.: Error-tolerant graph matching using homeomorphism. In: International Conference on Advances in Computing, Communication and Informatics (ICACCI), pp. 1762\u20131766 (2017)","DOI":"10.1109\/ICACCI.2017.8126099"},{"key":"32_CR8","first-page":"1450001.1","volume":"88","author":"P Foggia","year":"2014","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recogn. Artif. Intell. 88, 1450001.1\u20131450001.40 (2014)","journal-title":"Int. J. Pattern Recogn. Artif. Intell."},{"key":"32_CR9","doi-asserted-by":"publisher","DOI":"10.1142\/6855","volume-title":"Kernels for Structured Data","author":"T Gartner","year":"2008","unstructured":"Gartner, T.: Kernels for Structured Data. World Scientific, Singapore (2008)"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilson, N.J., Raphael, B.: A formal basis for heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4, 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"32_CR11","unstructured":"Haussler, D.: Convolution kernels on discrete structures. Technical report, UCSC-CRL-99-10, University of California, Sant Cruz (1999)"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1016\/j.is.2005.05.005","volume":"32","author":"M Kuramochi","year":"2007","unstructured":"Kuramochi, M., Karypis, G.: Discovering frequent geometric subgraphs. Inf. Syst. 32, 1101\u20131120 (2007)","journal-title":"Inf. Syst."},{"key":"32_CR13","first-page":"129","volume":"6","author":"J Lafferty","year":"2005","unstructured":"Lafferty, J., Lebanon, G.: Diffusion kernels on statistical manifolds. J. Mach. Learn. Res. 6, 129\u2013163 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11815921_17","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"M Neuhaus","year":"2006","unstructured":"Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR \/SPR 2006. LNCS, vol. 4109, pp. 163\u2013172. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11815921_17"},{"key":"32_CR15","doi-asserted-by":"publisher","DOI":"10.1142\/6523","volume-title":"Bridging the Gap Between Graph Edit Distance and Kernel Machines","author":"M Neuhaus","year":"2007","unstructured":"Neuhaus, M., Bunke, H.: Bridging the Gap Between Graph Edit Distance and Kernel Machines. World Scientific, Singapore (2007)"},{"issue":"11","key":"32_CR16","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1109\/TPAMI.2016.2636200","volume":"39","author":"MA Pinheiro","year":"2017","unstructured":"Pinheiro, M.A., Kybic, J., Fua, P.: Geometric graph matching using Monte Carlo tree search. IEEE Trans. Pattern Anal. Mach. Intell. 39(11), 2171\u20132185 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27","author":"A Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hancock, E.R.: Graph edit distance from spectral seriation. IEEE Trans. Pattern Anal. Mach. Intell. 27, 365\u2013378 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"K Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., et al. (eds.) SSPR \/SPR 2008. LNCS, vol. 5342, pp. 287\u2013297. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-89689-0_33"},{"issue":"4","key":"32_CR19","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(4), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"issue":"4","key":"32_CR20","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1016\/j.patcog.2014.11.002","volume":"48","author":"K Riesen","year":"2015","unstructured":"Riesen, K., Bunke, H.: Improving bipartite graph edit distance approximation using various search strategies. Pattern Recogn. 48(4), 1349\u20131363 (2015)","journal-title":"Pattern Recogn."},{"issue":"3","key":"32_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13(3), 353\u2013363 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"13928","key":"32_CR22","first-page":"1","volume":"8","author":"TA Schieber","year":"2017","unstructured":"Schieber, T.A., Carpi, L., Diaz-Guilera, A., Pardalos, P.M., Masoller, C., Ravetti, M.G.: Quantification of network structural dissimilarities. Nature Commun. 8(13928), 1\u201310 (2017)","journal-title":"Nature Commun."},{"issue":"34944","key":"32_CR23","first-page":"1","volume":"6","author":"Y Shimada","year":"2016","unstructured":"Shimada, Y., Hirata, Y., Ikeguchi, T., Aihara, K.: Graph distance for complex networks. Sci. Rep. 6(34944), 1\u20136 (2016)","journal-title":"Sci. Rep."},{"issue":"3","key":"32_CR24","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27","author":"A Shokoufandeh","year":"2005","unstructured":"Shokoufandeh, A., Macrini, D., Dickinson, S., Siddiqi, K., Zucker, S.: Indexing hierarchical structures using graph spectra. IEEE Trans. Pattern Anal. Mach. Intell. 27(3), 365\u2013378 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"32_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-31988-7_16","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S Sorlin","year":"2005","unstructured":"Sorlin, S., Solnon, C.: Reactive tabu search for measuring graph similarity. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol. 3434, pp. 172\u2013182. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31988-7_16"},{"key":"32_CR26","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/TSMC.1979.4310127","volume":"9","author":"WH Tsai","year":"1979","unstructured":"Tsai, W.H., Fu, K.S.: Error-correcting isomorphisms of attributed relational graphs for pattern analysis. IEEE Trans. Syst. Man Cybern. 9, 757\u2013768 (1979)","journal-title":"IEEE Trans. Syst. Man Cybern."}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97785-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:42:16Z","timestamp":1710348136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-97785-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319977843","9783319977850"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97785-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ssspr2018.buaa.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}