{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T23:30:54Z","timestamp":1773358254304,"version":"3.50.1"},"reference-count":134,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T00:00:00Z","timestamp":1345507200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10044-012-0284-8","type":"journal-article","created":{"date-parts":[[2012,8,20]],"date-time":"2012-08-20T07:14:48Z","timestamp":1345446888000},"page":"253-283","source":"Crossref","is-referenced-by-count":150,"title":["The graph matching problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Lorenzo","family":"Livi","sequence":"first","affiliation":[]},{"given":"Antonello","family":"Rizzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,21]]},"reference":[{"key":"284_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal C, Wang H (2010) Managing and mining graph data. Advances in Database Systems. Springer. http:\/\/books.google.com\/books?id=Ox39uLyYh-wC","DOI":"10.1007\/978-1-4419-6045-0"},{"key":"284_CR2","first-page":"821","volume":"25","author":"A Aizerman","year":"1964","unstructured":"Aizerman A, Braverman EM, Rozoner LI (1964) Theoretical foundations of the potential function method in pattern recognition learning. Automat Remote Control 25:821\u2013837","journal-title":"Automat Remote Control"},{"key":"284_CR3","doi-asserted-by":"crossref","unstructured":"Ambauen R, Fischer S, Bunke H (2003) Graph edit distance with node splitting and merging, and its application to diatom identification. In: Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition, GbRPR\u201903. Springer-Verlag, Berlin, Heidelberg, pp 95\u2013106. http:\/\/portal.acm.org\/citation.cfm?id=1757868.1757880","DOI":"10.1007\/3-540-45028-9_9"},{"key":"284_CR4","doi-asserted-by":"crossref","unstructured":"Bardaji I, Ferrer M, Sanfeliu A (2010) A comparison between two representatives of a set of graphs: median vs barycenter graph. In: Proceedings of the 2010 joint IAPR international conference on structural, syntactic, and statistical pattern recognition, SSPR& SPR\u201910. Springer-Verlag, Berlin, Heidelberg, pp 149\u2013158. http:\/\/portal.acm.org\/citation.cfm?id=1887003.1887022","DOI":"10.1007\/978-3-642-14980-1_14"},{"key":"284_CR5","doi-asserted-by":"crossref","unstructured":"Bargiela A, Pedrycz W (2003) Granular computing: an introduction. No. v. 2002 in Kluwer international series in engineering and computer science. Kluwer Academic Publishers. http:\/\/books.google.com\/books?id=F_3t7XTMhBkC","DOI":"10.1007\/978-1-4615-1033-8"},{"key":"284_CR6","doi-asserted-by":"crossref","unstructured":"Berg C, Christensen J, Ressel P (1984) Harmonic analysis on semigroups: theory of positive definite and related functions. Graduate texts in mathematics. Springer-Verlag http:\/\/books.google.com\/books?id=zz2DQgAACAAJ","DOI":"10.1007\/978-1-4612-1128-0_6"},{"key":"284_CR7","doi-asserted-by":"crossref","unstructured":"Bernard M, Boyer L, Habrard A, Sebban M (2008)Learning probabilistic models of tree edit distance. Pattern Recognit. 41:2611\u20132629. doi: 10.1016\/j.patcog.2008.01.011 . http:\/\/portal.acm.org\/citation.cfm?id=1367147.1367314","DOI":"10.1016\/j.patcog.2008.01.011"},{"key":"284_CR8","doi-asserted-by":"crossref","unstructured":"Bernstein D (2009) Matrix mathematics: theory, facts, and formulas. Princeton University Press. http:\/\/books.google.com\/books?id=jgEiuHlTCYcC","DOI":"10.1515\/9781400833344"},{"key":"284_CR9","doi-asserted-by":"crossref","unstructured":"Bille P (2005) A survey on tree edit distance and related problems. Theor Comput Sci 337:217\u2013239. doi: 10.1016\/j.tcs.2004.12.030. http:\/\/dx.doi.org\/10.1016\/j.tcs.2004.12.030","DOI":"10.1016\/j.tcs.2004.12.030"},{"key":"284_CR10","doi-asserted-by":"crossref","unstructured":"Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D (2006) Complex networks: structure and dynamics. Phys. Rep. 424(4\u20135):175\u2013308. doi: 10.1016\/j.physrep.2005.10.009. http:\/\/dx.doi.org\/10.1016\/j.physrep.2005.10.009","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"284_CR11","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s B (1998) Modern graph theory. Graduate texts in mathematics. Springer. http:\/\/books.google.ca\/books?id=SbZKSZ-1qrwC","DOI":"10.1007\/978-1-4612-0619-4_1"},{"key":"284_CR12","unstructured":"Borg I, Groenen P (2005) Modern multidimensional scaling: theory and applications. Springer series in statistics. Springer. http:\/\/books.google.com\/books?id=duTODldZzRcC"},{"key":"284_CR13","doi-asserted-by":"crossref","unstructured":"Borgelt C (2002) Mining molecular fragments: finding relevant substructures of molecules. In: Proceedings of 2002 IEEE international conference on data mining (ICDM). IEEE Press, pp 51\u201358","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"284_CR14","doi-asserted-by":"crossref","unstructured":"Borgwardt KM, Ong CS, Sch\u00f6nauer S, Vishwanathan SVN, Smola AJ, Kriegel HP (2005) Protein function prediction via graph kernels. Bioinformatics 21:47\u201356. http:\/\/dx.doi.org\/10.1093\/bioinformatics\/bti1007","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"284_CR15","doi-asserted-by":"crossref","unstructured":"Boser BE, Guyon IM, Vapnik VN (1992) A training algorithm for optimal margin classifiers. In: Proceedings of the fifth annual workshop on computational learning theory, COLT \u201992. ACM, New York, NY, USA, pp 144\u2013152. doi: 10.1145\/130385.130401 . http:\/\/doi.acm.org\/10.1145\/130385.130401","DOI":"10.1145\/130385.130401"},{"key":"284_CR16","doi-asserted-by":"crossref","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press. http:\/\/books.google.com\/books?id=mYm0bLd3fcoC","DOI":"10.1017\/CBO9780511804441"},{"key":"284_CR17","doi-asserted-by":"crossref","unstructured":"Bunke H, Allermann G (1983) Inexact graph matching for structural pattern recognition. Pattern Recognit Lett 1(4):245\u2013253 (1983). doi: 10.1016\/0167-8655(83)90033-8. http:\/\/www.sciencedirect.com\/science\/article\/B6V15-48MPV00-1K\/2\/6f816d072c71e50b1a80858a8b488463","DOI":"10.1016\/0167-8655(83)90033-8"},{"key":"284_CR18","doi-asserted-by":"crossref","unstructured":"Bunke H, B\u00fchler U (1993) Applications of approximate string matching to 2D shape recognition. Pattern Recognit 26(12):1797\u20131812. doi: 10.1016\/0031-3203(93)90177-X. http:\/\/www.sciencedirect.com\/science\/article\/B6V14-48MPPK4-1V6\/2\/c7f7a4bd6aae48534f11137815852e32","DOI":"10.1016\/0031-3203(93)90177-X"},{"key":"284_CR19","doi-asserted-by":"crossref","unstructured":"Bunke H, Shearer K (1998) A graph distance metric based on the maximal common subgraph. Pattern Recognit. Lett. 19:255\u2013259. doi: 10.1016\/S0167-8655(97)00179-7.","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"284_CR20","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1009715923555","volume":"2","author":"CJC Burges","year":"1998","unstructured":"Burges CJC (1998) A tutorial on support vector machines for pattern recognition. Data Min Knowl Disc 2:121\u2013167","journal-title":"Data Min Knowl Disc"},{"key":"284_CR21","doi-asserted-by":"crossref","unstructured":"Buriol LS, Castillo C, Donato D, Leonardi S, Millozzi S (2006) Temporal analysis of the wikigraph. In: Web intelligence conference. IEEE CS Press, pp 45\u201351","DOI":"10.1109\/WI.2006.164"},{"key":"284_CR22","unstructured":"Cinti A, Rizzi A (2011) Neurofuzzy min\u2013max networks implementation on FPGA. In: International joint conference on computational intalligence (IJCCI), neural computation theories and analysis (NCTA)"},{"key":"284_CR23","doi-asserted-by":"crossref","unstructured":"Conte D, Foggia P, Sansone C, Vento M (2004) Thirty years of graph matching In pattern recognition. Int J Pattern Recognit Artif Intell 18:265\u2013298. doi: 10.1142\/S0218001404003228","DOI":"10.1142\/S0218001404003228"},{"key":"284_CR24","doi-asserted-by":"crossref","unstructured":"Cook D, Holder L (2007) Mining graph data. Wiley-Interscience. http:\/\/books.google.com\/books?id=jp8ZIpMVB54C","DOI":"10.1002\/0470073047"},{"key":"284_CR25","unstructured":"Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20:273\u2013297. http:\/\/dx.doi.org\/10.1023\/A:1022627411411.10.1023\/A:1022627411411"},{"key":"284_CR26","doi-asserted-by":"crossref","unstructured":"Cox T, Cox M (2001) Multidimensional scaling. No. v. 1 in Monographs on statistics and applied probability. Chapman & Hall\/CRC. http:\/\/books.google.com\/books?id=SKZzmEZqvqkC","DOI":"10.1201\/9781420036121"},{"key":"284_CR27","unstructured":"Del Vescovo G, Livi L, Rizzi A, Frattale Mascioli FM (2011) Clustering structured data with the SPARE library. In: Proceeding of 2011 4th IEEE international conference on computer science and information technology, vol 9, pp 413\u2013417"},{"key":"284_CR28","doi-asserted-by":"crossref","unstructured":"Del Vescovo G, Rizzi A (2007) Automatic classification of graphs by symbolic histograms. In: Proceedings of the 2007 IEEE international conference on granular computing, GRC \u201907. IEEE Computer Society, pp 410\u2013416. doi: 10.1109\/GRC.2007.46. http:\/\/dx.doi.org\/10.1109\/GRC.2007.46","DOI":"10.1109\/GrC.2007.46"},{"key":"284_CR29","doi-asserted-by":"crossref","unstructured":"Del Vescovo G, Rizzi A (2007) Online handwriting recognition by the symbolic histograms approach. In: Proceedings of the 2007 IEEE international conference on granular computing, GRC \u201907. IEEE Computer Society, Washington, DC, USA, p 686. doi: 10.1109\/GRC.2007.116 . http:\/\/dx.doi.org\/10.1109\/GRC.2007.116","DOI":"10.1109\/GrC.2007.116"},{"issue":"1","key":"284_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc Ser B 39(1):1\u201338","journal-title":"J R Stat Soc Ser B"},{"key":"284_CR31","unstructured":"Diestel R (2006) Graph theory. Graduate texts in mathematics. Springer. http:\/\/books.google.com\/books?id=aR2TMYQr2CMC"},{"key":"284_CR32","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269\u2013271 http:\/\/dx.doi.org\/10.1007\/BF01386390.10.1007\/BF01386390"},{"key":"284_CR33","unstructured":"Dorfler F, Bullo F (2011) Kron reduction of graphs with applications to electrical networks. ArXiv e-prints"},{"key":"284_CR34","doi-asserted-by":"crossref","unstructured":"ElGhawalby H, Hancock ER (2008) Graph characteristic from the Gauss\u2013Bonnet Theorem. In: Lobo NdV, Kasparis T, Roli F, Kwok JTY, Georgiopoulos M, Anagnostopoulos GC, Loog M (eds) SSPR\/SPR, lecture notes in computer science, vol 5342. Springer, pp 207\u2013216","DOI":"10.1007\/978-3-540-89689-0_25"},{"key":"284_CR35","doi-asserted-by":"crossref","unstructured":"Emms, D., Wilson, R.C., Hancock, E. (2007) Graph embedding using quantum commute times. In: Proceedings of the 6th IAPR-TC-15 international conference on graph-based representations in pattern recognition, GbRPR\u201907. Springer-Verlag, Berlin, Heidelberg, pp 371\u2013382. http:\/\/portal.acm.org\/citation.cfm?id=1769371.1769412","DOI":"10.1007\/978-3-540-72903-7_34"},{"issue":"3","key":"284_CR36","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TSMC.1984.6313232","volume":"14","author":"MA Eshera","year":"1984","unstructured":"Eshera MA, Fu KS (1984) A graph distance measure for image analysis. IEEE Trans Syst Man Cybern 14(3):398\u2013408","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"284_CR37","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Lin KI (1995) FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. SIGMOD Rec 24:163\u2013174. doi: 10.1145\/568271.223812 . http:\/\/doi.acm.org\/10.1145\/568271.223812","DOI":"10.1145\/568271.223812"},{"key":"284_CR38","unstructured":"Fankhauser S, Riesen K, Bunke H (2011) Speeding up graph edit distance computation through fast bipartite matching. In: Jiang X, Ferrer M, Torsello A (eds) Graph-based representations in pattern recognition. Lecture notes in computer science, vol 6658. Springer, Berlin, pp 102\u2013111. http:\/\/dx.doi.org\/10.1007\/978-3-642-20844-7_11.10.1007\/978-3-642-20844-7_11"},{"key":"284_CR39","doi-asserted-by":"crossref","unstructured":"Fortune S, Wyllie J (1978) Parallelism in random access machines. In: Proceedings of the tenth annual ACM symposium on Theory of computing, STOC \u201978. ACM, New York, NY, USA, pp 114\u2013118. doi: 10.1145\/800133.804339. http:\/\/doi.acm.org\/10.1145\/800133.804339","DOI":"10.1145\/800133.804339"},{"key":"284_CR40","doi-asserted-by":"crossref","unstructured":"Gao X, Xiao B, Tao D, Li X (2008) Image categorization: graph edit direction histogram. Pattern Recognit 41(10):3179\u20133191. doi: 10.1016\/j.patcog.2008.03.025 http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0031320308001246","DOI":"10.1016\/j.patcog.2008.03.025"},{"issue":"1","key":"284_CR41","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao X, Xiao B, Tao D, Li X (2010) A survey of graph edit distance. Pattern Anal Appl 13(1):113\u2013129","journal-title":"Pattern Anal Appl"},{"key":"284_CR42","unstructured":"Garey MR, Johnson DS (1990) Computers and Intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., New York, NY, USA"},{"key":"284_CR43","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner T (2008) Kernels for structured data. No v 72 in kernels for structured data. World Scientific. http:\/\/books.google.com\/books?id=ykomKZ5rD1gC","DOI":"10.1142\/9789812814562"},{"key":"284_CR44","doi-asserted-by":"crossref","unstructured":"Gartner T, Flach P, Wrobel S (2003) On graph kernels: hardness results and efficient alternatives. Lecture notes in computer science, pp 129\u2013143","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"284_CR45","doi-asserted-by":"crossref","unstructured":"Ghias A, Logan J, Chamberlin D, Smith BC (1995) Query by humming: musical information retrieval in an audio database. In: ACM Multimedia, pp 231\u2013236","DOI":"10.1145\/217279.215273"},{"key":"284_CR46","unstructured":"Gibert J, Valveny E, Bunke H (2011) Dimensionality reduction for graph of words embedding. In: Jiang X, Ferrer M, Torsello A (eds) Graph-based representations in pattern recognition. Lecture notes in computer science, vol 6658. Springer Berlin, pp 22\u201331. http:\/\/dx.doi.org\/10.1007\/978-3-642-20844-7_3.10.1007\/978-3-642-20844-7_3"},{"key":"284_CR47","doi-asserted-by":"crossref","unstructured":"Giuliani A, Benigni R, Zbilut JP, Webber Jr CL, Sirabella P, Colosimo A (2002) Nonlinear signal analysis methods in the Elucidation of protein sequence\u2014structure relationships. ChemInform 33(28). doi: 10.1002\/chin.200228300. http:\/\/dx.doi.org\/10.1002\/chin.200228300","DOI":"10.1002\/chin.200228300"},{"key":"284_CR48","doi-asserted-by":"crossref","unstructured":"Goldfarb L (1984) A unified approach to pattern recognition. Pattern Recognit 17(5):575\u2013582. doi: 10.1016\/0031-3203(84)90056-6. http:\/\/www.sciencedirect.com\/science\/article\/B6V14-48MPJHK-J1\/2\/b156c1fd23bfed84bd0db8f8ec523c88","DOI":"10.1016\/0031-3203(84)90056-6"},{"key":"284_CR49","doi-asserted-by":"crossref","unstructured":"Goldschlager LM (1982) A universal interconnection pattern for parallel computers. J ACM 29:1073\u20131086 doi: 10.1145\/322344.322353 . http:\/\/doi.acm.org\/10.1145\/322344.322353","DOI":"10.1145\/322344.322353"},{"key":"284_CR50","unstructured":"Gori M, Maggini M, Sarti L (2004) Graph matching using random walks. In: Proceedings of the pattern recognition, 17th international conference on (ICPR\u201904) volume 3, vol 03, ICPR \u201904. IEEE Computer Society, Washington, DC, USA , pp 394\u2013397. doi: 10.1109\/ICPR.2004.422. http:\/\/dx.doi.org\/10.1109\/ICPR.2004.422"},{"key":"284_CR51","doi-asserted-by":"crossref","unstructured":"Hagmann P, Cammoun L, Gigandet X, Meuli R, Honey CJ, Sporns O (2008) Mapping the structural core of human cerebral cortex. PLoS Biol 6(7):e159. doi: 10.1371\/journal.pbio.0060159. http:\/\/dx.doi.org\/10.1371\/journal.pbio.0060159","DOI":"10.1371\/journal.pbio.0060159"},{"key":"284_CR52","doi-asserted-by":"crossref","unstructured":"Hart P, Nilsson N, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100\u2013107. doi: 10.1109\/TSSC.1968.300136 . http:\/\/dx.doi.org\/10.1109\/TSSC.1968.300136","DOI":"10.1109\/TSSC.1968.300136"},{"key":"284_CR53","unstructured":"Haussler D (1999) Convolution kernels on discrete structures. Technical report"},{"key":"284_CR54","unstructured":"Hell P, Nes\u0161et\u0159il J (2004) Graphs and homomorphisms. Oxford lecture series in mathematics and its applications. Oxford University Press. http:\/\/books.google.it\/books?id=bJXWV-qK7kYC"},{"key":"284_CR55","doi-asserted-by":"crossref","unstructured":"Hopcroft JE, Wong JK (1974) Linear time algorithm for isomorphism of planar graphs (Preliminary Report). In: Proceedings of the sixth annual ACM symposium on Theory of computing, STOC \u201974. ACM, New York, NY, USA, pp 172\u2013184. doi: 10.1145\/800119.803896 . http:\/\/doi.acm.org\/10.1145\/800119.803896","DOI":"10.1145\/800119.803896"},{"key":"284_CR56","unstructured":"Imrich W, Klav\u017ear S (2000) Product graphs, structure and recognition. Wiley-Interscience series in discrete mathematics and optimization. Wiley. http:\/\/books.google.com\/books?id=EOnuAAAAMAAJ"},{"key":"284_CR57","doi-asserted-by":"crossref","unstructured":"Izenman A (2008) Modern multivariate statistical techniques: regression, classification, and manifold learning. Springer texts in statistics. Springer. http:\/\/books.google.com\/books?id=1CuznRORa3EC","DOI":"10.1007\/978-0-387-78189-1"},{"key":"284_CR58","unstructured":"Jain B, Obermayer K (2011) Maximum likelihood for Gaussians on graphs. In: Jiang X, Ferrer M, Torsello A (eds) Graph-based representations in pattern recognition. Lecture notes in computer science, vol 6658. Springer, Berlin, pp 62\u201371. http:\/\/dx.doi.org\/10.1007\/978-3-642-20844-7_7.10.1007\/978-3-642-20844-7_7"},{"key":"284_CR59","unstructured":"Jain BJ, Obermayer K (2009) Structure spaces. J Mach Learn Res 10:2667\u20132714. http:\/\/portal.acm.org\/citation.cfm?id=1577069.1755876"},{"key":"284_CR60","doi-asserted-by":"crossref","unstructured":"Jain BJ, Wysotzki F (2004) Central clustering of attributed graphs. Mach Learn 56:169\u2013207. doi: 10.1023\/B:MACH.0000033119.52532.ce. http:\/\/portal.acm.org\/citation.cfm?id=1007760.1007768","DOI":"10.1023\/B:MACH.0000033119.52532.ce"},{"key":"284_CR61","doi-asserted-by":"crossref","unstructured":"Jiang X, M\u00fcunger A, Bunke H (2001) On median graphs: properties, algorithms, and applications. IEEE Trans Pattern Anal Mach Intell 23:1144\u20131151. doi: 10.1109\/34.954604. http:\/\/dx.doi.org\/10.1109\/34.954604","DOI":"10.1109\/34.954604"},{"key":"284_CR62","unstructured":"Jolliffe I (2002) Principal component analysis. Springer series in statistics. Springer. http:\/\/books.google.com\/books?id=_olByCrhjwIC"},{"key":"284_CR63","unstructured":"Kashima H, Tsuda K, Inokuchi A (2003) Marginalized kernels between labeled graphs. In: Proceedings of the twentieth international conference on machine learning. AAAI Press, pp 321\u2013328"},{"key":"284_CR64","doi-asserted-by":"crossref","unstructured":"Kazius J, McGuire R, Bursi R (2005) Derivation and validation of toxicophores for mutagenicity prediction. J Med Chem 48(1):312\u2013320. doi: 10.1021\/jm040835a. http:\/\/pubs.acs.org\/doi\/abs\/10.1021\/jm040835a","DOI":"10.1021\/jm040835a"},{"key":"284_CR65","doi-asserted-by":"crossref","unstructured":"Kohonen T (2001) Self-organizing maps. Springer series in information sciences. Springer. http:\/\/books.google.com\/books?id=e4igHzyf078C","DOI":"10.1007\/978-3-642-56927-2"},{"key":"284_CR66","unstructured":"Kondor RI, Lafferty J (2002) Diffusion kernels on graphs and other discrete structures. In: Proceedings of the ICML, pp 315\u2013322"},{"key":"284_CR67","doi-asserted-by":"crossref","unstructured":"Kruskal J (1962) Nonmetric multidimensional scaling: a numerical method. Psychometrika 29(2):115\u2013129. http:\/\/ideas.repec.org\/a\/spr\/psycho\/v29y1964i2p115-129.html","DOI":"10.1007\/BF02289694"},{"key":"284_CR68","doi-asserted-by":"crossref","unstructured":"Kruskal J, Wish M (1978) Multidimensional scaling. Quantitative applications in the social sciences. Sage Publications. http:\/\/books.google.com\/books?id=ZzmIPcEXPf0C","DOI":"10.4135\/9781412985130"},{"issue":"1","key":"284_CR69","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback S, Leibler RA (1951) On information and sufficiency. Ann Math Stat 22(1):79\u201386","journal-title":"Ann Math Stat"},{"key":"284_CR70","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2002) An efficient algorithm for discovering frequent subgraphs. Technical report, IEEE Transactions on Knowledge and Data Engineering","DOI":"10.21236\/ADA439497"},{"key":"284_CR71","unstructured":"Leslie C, Kuang R (2004) Fast string kernels using inexact matching for protein sequences. J Mach Learn Res 5: 1435\u20131455. http:\/\/dl.acm.org\/citation.cfm?id=1005332.1044708"},{"key":"284_CR72","unstructured":"Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions, and reversals. Technical Report 8"},{"key":"284_CR73","unstructured":"Levi G (1973) A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9:341\u2013352. http:\/\/dx.doi.org\/10.1007\/BF02575586.10.1007\/BF02575586"},{"key":"284_CR74","doi-asserted-by":"crossref","unstructured":"Livi L, Del Vescovo G, Rizzi A (2012) Graph recognition by seriation and frequent substructures mining. In: Proceeding of the first international conference on pattern recognition applications and methods 1:186\u2013191. doi: 10.5220\/0003733201860191","DOI":"10.5220\/0003733201860191"},{"key":"284_CR75","doi-asserted-by":"crossref","unstructured":"Livi L, Del Vescovo G, Rizzi A (2012) Inexact graph matching through graph coverage. In: Proceeding of the first international conference on pattern recognition applications and methods 1:269\u2013272. doi: 10.5220\/0003732802690272","DOI":"10.5220\/0003732802690272"},{"key":"284_CR76","doi-asserted-by":"crossref","unstructured":"Livi L, Rizzi A (2012) Parallel algorithms for tensor product-based inexact graph matching. In: Proceeding of the 2012 IEEE International Joint Conference on Neural Networks. IEEE, Brisbane, Australia, pp 2276\u20132283. doi: 10.1109\/IJCNN.2012.6252681 . ISBN 978-1-4673-1489-3","DOI":"10.1109\/IJCNN.2012.6252681"},{"key":"284_CR77","first-page":"669","volume":"5","author":"UV Luxburg","year":"2003","unstructured":"Luxburg UV, Bousquet O (2003) Distance-based classification with Lipschitz functions. J Mach Learn Res 5:669\u2013695","journal-title":"J Mach Learn Res"},{"issue":"6","key":"284_CR78","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1016\/S0165-1684(00)00016-5","volume":"80","author":"FMF Mascioli","year":"2000","unstructured":"Mascioli FMF, Rizzi A, Panella M, Martinelli G (2000) Scale-based approach to hierarchical fuzzy clustering. Signal Process 80(6):1001\u20131016","journal-title":"Signal Process"},{"key":"284_CR79","doi-asserted-by":"crossref","unstructured":"Menchetti S, Costa F, Frasconi P (2005) Weighted decomposition kernels. In: Proceedings of the 22nd international conference on Machine learning, ICML \u201905. ACM, New York, NY, USA, pp 585\u2013592. doi: 10.1145\/1102351.1102425. http:\/\/doi.acm.org\/10.1145\/1102351.1102425","DOI":"10.1145\/1102351.1102425"},{"key":"284_CR80","doi-asserted-by":"crossref","unstructured":"Mercer J (1909) Functions of positive and negative type, and their connection with the theory of integral equations. In: Philosophical transactions of the royal society of London. Series A, containing papers of a mathematical or physical character, vol 209, pp 415\u2013446. http:\/\/www.jstor.org\/stable\/91043","DOI":"10.1098\/rsta.1909.0016"},{"key":"284_CR81","doi-asserted-by":"crossref","unstructured":"Munkres J (1957) Algorithms for the assignment and transportation problems. J Soc Ind Appl Math 5(1):32\u201338. http:\/\/scitation.aip.org\/getabs\/servlet\/GetabsServlet?prog=normal&id=SMJMAP000005000001000032000001&idtype=cvips&gifs=yes","DOI":"10.1137\/0105003"},{"key":"284_CR82","unstructured":"Munkres J (2000) Topology. Prentice Hall. http:\/\/books.google.com\/books?id=XjoZAQAAIAAJ"},{"key":"284_CR83","doi-asserted-by":"crossref","unstructured":"Neuhaus M, Bunke H (2004) A probabilistic approach to learning costs for graph edit distance. In: Proceedings of the 17th international conference on pattern recognition, pp 389\u2013393","DOI":"10.1109\/ICPR.2004.1334548"},{"key":"284_CR84","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TSMCB.2005.846635","volume":"35","author":"M Neuhaus","year":"2005","unstructured":"Neuhaus M, Bunke H (2005) Self-organizing maps for learning the edit costs in graph matching. IEEE Trans Syst Man Cybern B 35:503\u2013514","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"284_CR85","doi-asserted-by":"crossref","unstructured":"Neuhaus M, Bunke H (2006) A convolution edit kernel for error-tolerant graph matching. In: ICPR (4). IEEE Computer Society, pp 220\u2013223","DOI":"10.1109\/ICPR.2006.57"},{"key":"284_CR86","unstructured":"Neuhaus M, Bunke H (2006) A random walk kernel derived from graph edit distance. In: Yeung DY, Kwok J, Fred A, Roli F, de Ridder D (eds) Structural, syntactic, and statistical pattern recognition. Lecture notes in computer science, vol 4109. Springer, Berlin, pp 191\u2013199. http:\/\/dx.doi.org\/10.1007\/11815921_20.10.1007\/11815921_20"},{"key":"284_CR87","doi-asserted-by":"crossref","unstructured":"Neuhaus M, Bunke H (2007) A quadratic programming approach to the graph edit distance problem. In: Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition, GbRPR\u201907. Springer-Verlag, Berlin, pp 92\u2013102. http:\/\/portal.acm.org\/citation.cfm?id=1769371.1769382","DOI":"10.1007\/978-3-540-72903-7_9"},{"issue":"1","key":"284_CR88","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"M Neuhaus","year":"2007","unstructured":"Neuhaus M, Bunke H (2007) Automatic learning of cost functions for graph edit distance. Inf Sci 177(1):239\u2013247","journal-title":"Inf Sci"},{"key":"284_CR89","doi-asserted-by":"crossref","unstructured":"Neuhaus M, Bunke H (2007) Bridging the gap between graph edit distance and kernel machines. Series in machine perception and artificial intelligence. World Scientific. http:\/\/books.google.com\/books?id=xM_5hvL1AlkC","DOI":"10.1142\/9789812770202"},{"key":"284_CR90","doi-asserted-by":"crossref","unstructured":"Neuhaus M, Riesen K, Bunke H (2006) Fast suboptimal algorithms for the computation of graph edit distance. In: Structural, syntactic, and statistical pattern recognition. LNCS. Springer, pp 163\u2013172","DOI":"10.1007\/11815921_17"},{"key":"284_CR91","unstructured":"Nocedal J, Wright S (2006) Numerical optimization. Springer series in operations research. Springer. http:\/\/books.google.com\/books?id=eNlPAAAAMAAJ"},{"key":"284_CR92","doi-asserted-by":"crossref","unstructured":"Pekalska E, Duin R (2005) The dissimilarity representation for pattern recognition: foundations and applications. Series in machine perception and artificial intelligence. World Scientific. http:\/\/books.google.com\/books?id=YPPr6eypHFwC","DOI":"10.1142\/9789812703170"},{"key":"284_CR93","doi-asserted-by":"crossref","unstructured":"Peris G (2002) Fast cyclic edit distance computation with weighted edit costs in classification. In: Proceedings of the 16th international conference on pattern recognition (ICPR\u201902) volume 4, vol 4. ICPR \u201902. IEEE Computer Society, Washington, DC, USA, pp 40,184. http:\/\/portal.acm.org\/citation.cfm?id=846227.848570","DOI":"10.1109\/ICPR.2002.1047428"},{"key":"284_CR94","doi-asserted-by":"crossref","unstructured":"Qiu H, Hancock ER (2006) Graph matching and clustering using spectral partitions. Pattern Recognit 39:22\u201334. doi: 10.1016\/j.patcog.2005.06.014. . http:\/\/portal.acm.org\/citation.cfm?id=1220964.1221155","DOI":"10.1016\/j.patcog.2005.06.014"},{"issue":"3","key":"284_CR95","first-page":"99","volume":"8","author":"I Rao","year":"2010","unstructured":"Rao I, Sarma K (2010) On tensor product of standard graphs. Int J Comput Cognit 8(3):99","journal-title":"Int J Comput Cognit"},{"key":"284_CR96","doi-asserted-by":"crossref","unstructured":"Ren P, Wilson RC, Hancock ER (2009) Characteristic polynomial analysis on matrix representations of graphs. In: Torsello A, Escolano F, Brun L (eds) GbRPR. Lecture notes in computer science, vol 5534. Springer, pp 243\u2013252","DOI":"10.1007\/978-3-642-02124-4_25"},{"key":"284_CR97","doi-asserted-by":"crossref","unstructured":"Riesen K, Bunke H (2008) IAM graph database repository for graph based pattern recognition and machine learning. In: Proceedings of the 2008 joint IAPR international workshop on structural, syntactic, and statistical pattern recognition, SSPR & SPR \u201908. Springer-Verlag, Berlin, pp 287\u2013297. doi: 10.1007\/978-3-540-89689-0_33. . http:\/\/dx.doi.org\/10.1007\/978-3-540-89689-0_33","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"284_CR98","doi-asserted-by":"crossref","unstructured":"Riesen K, Bunke H (2009) Approximate graph edit distance computation by means of bipartite graph matching. Image Vis Comput 27:950\u2013959. doi: 10.1016\/j.imavis.2008.04.004 . http:\/\/portal.acm.org\/citation.cfm?id=1534927.1534959","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"284_CR99","doi-asserted-by":"crossref","unstructured":"Riesen K, Bunke H (2009) Reducing the dimensionality of dissimilarity space embedding graph kernels. Eng Appl Artif Intell 22:48\u201356. doi: 10.1016\/j.engappai.2008.04.006. . http:\/\/portal.acm.org\/citation.cfm?id=1497654.1498530","DOI":"10.1016\/j.engappai.2008.04.006"},{"key":"284_CR100","doi-asserted-by":"crossref","unstructured":"Riesen K, Bunke H (2010) Graph classification and clustering based on vector space embedding. Series in Machine Perception and Artificial Intelligence. World Scientific Pub Co Inc. http:\/\/books.google.com\/books?id=hKr9QwAACAAJ","DOI":"10.1142\/9789814304726"},{"key":"284_CR101","doi-asserted-by":"crossref","unstructured":"Rizzi A, Del Vescovo G (2006) Automatic image classification by a granular computing approach. In: Machine learning for signal processing, 2006. Proceedings of the 2006 16th IEEE signal processing society workshop, pp 33\u201338. doi: 10.1109\/MLSP.2006.275517","DOI":"10.1109\/MLSP.2006.275517"},{"key":"284_CR102","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/72.991426","volume":"13","author":"A Rizzi","year":"2002","unstructured":"Rizzi A, Panella M, Frattale Mascioli FM (2002) Adaptive resolution min-max classifiers. IEEE Trans Neural Netw 13:402\u2013414","journal-title":"IEEE Trans Neural Netw"},{"key":"284_CR103","doi-asserted-by":"crossref","unstructured":"Robles-Kelly A, Hancock E (2009) String edit distance, random walks and graph matching. In: Caelli T, Amin A, Duin RPW, Ridder D, Kamel M (eds) Structural, syntactic, and statistical pattern recognition. Lecture notes in computer science 2396, chap 10. Springer, Berlin, Berlin, pp. 107\u2013129. doi: 10.1007\/3-540-70659-3_10. . http:\/\/dx.doi.org\/10.1007\/3-540-70659-3_10","DOI":"10.1007\/3-540-70659-3_10"},{"key":"284_CR104","doi-asserted-by":"crossref","unstructured":"Robles-Kelly A, Hancock ER (2005) Graph edit distance from spectral seriation. IEEE Trans Pattern Anal Mach Intell 27:365\u2013378. doi: 10.1109\/TPAMI.2005.56 . http:\/\/dx.doi.org\/10.1109\/TPAMI.2005.56","DOI":"10.1109\/TPAMI.2005.56"},{"issue":"3","key":"284_CR105","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1016\/j.patcog.2006.05.031","volume":"40","author":"A Robles-Kelly","year":"2007","unstructured":"Robles-Kelly A, Hancock ER (2007) A Riemannian approach to graph embedding. Pattern Recognit 40(3):1042\u20131056","journal-title":"Pattern Recognit"},{"key":"284_CR106","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"26","author":"H Sakoe","year":"1978","unstructured":"Sakoe H (1978) Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans Acoust Speech Signal Process 26:43\u201349","journal-title":"IEEE Trans Acoust Speech Signal Process"},{"key":"284_CR107","doi-asserted-by":"crossref","unstructured":"Sammon JW (1969) A nonlinear mapping for data structure analysis. IEEE Trans Comput 18:401\u2013409. doi: 10.1109\/T-C.1969.222678 . http:\/\/dx.doi.org\/10.1109\/T-C.1969.222678","DOI":"10.1109\/T-C.1969.222678"},{"issue":"03","key":"284_CR108","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1017\/S1446788700020619","volume":"20","author":"E Sampathkumar","year":"1975","unstructured":"Sampathkumar E (1975) On tensor product graphs. J Aust Math Soc Ser A 20(03):268\u2013273","journal-title":"J Aust Math Soc Ser A"},{"issue":"3","key":"284_CR109","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu A, Fu KS (1983) A distance measure between attributed relational graphs for pattern recognition. IEEE Trans Syst Man Cybern 13(3):353\u2013362","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"284_CR110","unstructured":"Schenker A, Bunke H, Last M, Kandel A (2005) Graph-theoretic techniques for web content mining 62. World Scientific Pub. http:\/\/books.google.com\/books?hl=en&lr=&id=hNJozkPJAEwC&oi=fnd&pg=PP1&dq=Graph-Theoretic+Techniques+for+Web+Content+Mining&ots=PPVMc-VCA1&sig=d6Fok33vLb-WBFstYIpr7ijn4jM"},{"key":"284_CR111","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf B, Smola A (2002) Learning with kernels: support vector machines, regularization, optimization, and beyond. Adapt Comput Mach Learn. MIT Press. http:\/\/books.google.com\/books?id=y8ORL3DWt4sC","DOI":"10.7551\/mitpress\/4175.001.0001"},{"key":"284_CR112","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf B, Tsuda K, Vert J (2004) Kernel methods in computational biology. Comput Mol Biol. MIT Press. http:\/\/books.google.it\/books?id=SwAooknaMXgC","DOI":"10.7551\/mitpress\/4057.001.0001"},{"key":"284_CR113","doi-asserted-by":"crossref","unstructured":"Shawe-Taylor J, Cristianini N (2004) Kernel methods for pattern analysis. Cambridge University Press. http:\/\/books.google.com\/books?id=9i0vg12lti4C","DOI":"10.1017\/CBO9780511809682"},{"key":"284_CR114","unstructured":"Smola AJ, Kondor RI (2003) Kernels and regularization on graphs. In: Scholkopf B, Warmuth MK (eds) Computational learning theory and kernel machines, 16th annual conference on computational learning theory and 7th Kernel workshop, COLT\/Kernel 2003. Lecture notes in computer science, vol 2777. Springer, Washington, pp 144\u2013158. ISBN 3-540-40720-0"},{"key":"284_CR115","doi-asserted-by":"crossref","unstructured":"Tang J, Zhang C, Luo B (2006) A new approach to graph seriation. In: Proceedings of the first international conference on innovative computing, information and control, vol 3, ICICIC \u201906. IEEE Computer Society, Washington, DC, USA, pp 625\u2013628. doi: 10.1109\/ICICIC.2006.385 . http:\/\/dx.doi.org\/10.1109\/ICICIC.2006.385","DOI":"10.1109\/ICICIC.2006.385"},{"key":"284_CR116","doi-asserted-by":"crossref","unstructured":"Teo CH, Vishwanathan SVN (2006) Fast and space efficient string kernels using suffix arrays. In: Proceedings of the 23rd international conference on Machine learning, ICML 2006. ACM, New York, NY, USA , pp 929\u2013936. doi: 10.1145\/1143844.1143961. . http:\/\/doi.acm.org\/10.1145\/1143844.1143961","DOI":"10.1145\/1143844.1143961"},{"key":"284_CR117","unstructured":"Theodoridis S, Koutroumbas K (2006) Pattern recognition. Elsevier, Academic Press. http:\/\/books.google.com\/books?id=gAGRCmp8Sp8C"},{"key":"284_CR118","doi-asserted-by":"crossref","unstructured":"Thomas LT, Valluri SR, Karlapalem K (2006) Margin: maximal frequent subgraph mining. In: Proceedings of the sixth international conference on data mining, ICDM\u201906. IEEE Computer Society, Washington, pp 1097\u20131101. doi: 10.1109\/ICDM.2006.102 . http:\/\/dx.doi.org\/10.1109\/ICDM.2006.102 . ISBN 0-7695-2701-9","DOI":"10.1109\/ICDM.2006.102"},{"key":"284_CR119","doi-asserted-by":"crossref","unstructured":"Torsello A, Hancock ER (2007) Graph embedding using tree edit-union. Pattern Recognit 40:1393\u20131405 doi: 10.1016\/j.patcog.2006.09.006. http:\/\/portal.acm.org\/citation.cfm?id=1224549.1224568","DOI":"10.1016\/j.patcog.2006.09.006"},{"key":"284_CR120","doi-asserted-by":"crossref","unstructured":"Torsello A, Robles-Kelly A, Hancock ER (2007) Discovering shape classes using tree edit-distance and pairwise clustering. Int J Comput Vis 72:259\u2013285. doi: 10.1007\/s11263-006-8929-y. . http:\/\/portal.acm.org\/citation.cfm?id=1210315.1210321","DOI":"10.1007\/s11263-006-8929-y"},{"key":"284_CR121","doi-asserted-by":"crossref","unstructured":"Tun K, Dhar P, Palumbo M, Giuliani A (2006) Metabolic pathways variability and sequence\/networks comparisons. BMC Bioinf 7(1):24. doi: 10.1186\/1471-2105-7-24 . http:\/\/www.biomedcentral.com\/1471-2105\/7\/24","DOI":"10.1186\/1471-2105-7-24"},{"key":"284_CR122","doi-asserted-by":"crossref","unstructured":"Valiant LG (1990) A bridging model for parallel computation. Commun. ACM 33:103\u2013111. doi: 10.1145\/79173.79181 . http:\/\/doi.acm.org\/10.1145\/79173.79181","DOI":"10.1145\/79173.79181"},{"key":"284_CR123","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan SVN, Borgwardt KM, Kondor RI, Schraudolph NN (2010) Graph kernels. J Mach Learn Res 11:1201\u20131242","journal-title":"J Mach Learn Res"},{"key":"284_CR124","unstructured":"Vishwanathan SVN, Smola AJ (2002) Fast kernels for string and tree matching. In: Neural information processing systems, pp 569\u2013576"},{"key":"284_CR125","doi-asserted-by":"crossref","unstructured":"Washio T, Motoda H (2003) State of the art of graph-based data mining. SIGKDD Explor. Newsl 5:59\u201368. doi: 10.1145\/959242.959249 . http:\/\/doi.acm.org\/10.1145\/959242.959249","DOI":"10.1145\/959242.959249"},{"key":"284_CR126","doi-asserted-by":"crossref","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511815478"},{"key":"284_CR127","unstructured":"Watkins C (1999) Kernels from matching operations. Technical report, CSD-TR 98-07, University of London, Computer Science Department, Royal Holloway"},{"key":"284_CR128","doi-asserted-by":"crossref","unstructured":"Weaver N (1999) Lipschitz algebras. World Scientific. http:\/\/books.google.com\/books?id=45rnwyVjg_QC","DOI":"10.1142\/4100"},{"key":"284_CR129","doi-asserted-by":"crossref","unstructured":"Xiao B, Gao X, Tao D, Li X (2008) HMM-based graph edit distance for image indexing. Int J Imaging Syst Technol 18(2\u20133):209\u2013218. doi: 10.1002\/ima.20146. . http:\/\/dx.doi.org\/10.1002\/ima.20146","DOI":"10.1002\/ima.20146"},{"key":"284_CR130","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE international conference on data mining, ICDM \u201902. IEEE Computer Society, Washington, pp. 721\u2013724. http:\/\/dl.acm.org\/citation.cfm?id=844380.844811 . ISBN 0-7695-1754-4"},{"key":"284_CR131","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) CloseGraph: mining closed frequent graph patterns. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD \u201903. ACM, New York, NY, USA, pp 286\u2013295. doi: 10.1145\/956750.956784 . http:\/\/doi.acm.org\/10.1145\/956750.956784","DOI":"10.1145\/956750.956784"},{"key":"284_CR132","doi-asserted-by":"crossref","unstructured":"Yu H, Hancock ER (2006) String kernels for matching seriated graphs. In: Proceedings of the 18th international conference on pattern recognition, vol 04, ICPR \u201906. IEEE Computer Society, Washington, DC, USA, pp 224\u2013228. doi: 10.1109\/ICPR.2006.1081 . http:\/\/dx.doi.org\/10.1109\/ICPR.2006.1081","DOI":"10.1109\/ICPR.2006.1081"},{"key":"284_CR133","doi-asserted-by":"crossref","unstructured":"Zadeh LA (1965) Fuzzy sets. Inf Control 8(3):338\u2013353. doi: 10.1016\/S0019-9958(65)90241-X . http:\/\/dx.doi.org\/10.1016\/S0019-9958(65)90241-X","DOI":"10.1016\/S0019-9958(65)90241-X"},{"key":"284_CR134","doi-asserted-by":"crossref","unstructured":"Zinman GE, Zhong S, Bar-Joseph Z (2011) Biological interaction networks are conserved at the module level. BMC Syst Biol 5(1):134+. doi: 10.1186\/1752-0509-5-134. . http:\/\/dx.doi.org\/10.1186\/1752-0509-5-134","DOI":"10.1186\/1752-0509-5-134"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-012-0284-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-012-0284-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-012-0284-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T00:00:33Z","timestamp":1743984033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-012-0284-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,21]]},"references-count":134,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1007\/s10044-012-0284-8","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,21]]}}}