{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:03:40Z","timestamp":1760609020585,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T00:00:00Z","timestamp":1510185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003475","name":"Hasler Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003475","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s11063-017-9739-7","type":"journal-article","created":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T06:59:31Z","timestamp":1510210771000},"page":"691-707","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Impact of Using Utilities Rather than Costs for Graph Matching"],"prefix":"10.1007","volume":"48","author":[{"given":"Kaspar","family":"Riesen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst","family":"Bunke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,9]]},"reference":[{"key":"9739_CR1","doi-asserted-by":"crossref","unstructured":"Achatz H, Kleinschmidt P, Paparrizos K (1991) Applied geometry and discrete mathematics, chap. A dual forest algorithm for the assignment problem. AMS 1\u201311 (1991)","DOI":"10.1090\/dimacs\/004\/01"},{"issue":"1","key":"9739_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1287\/opre.40.1.S5","volume":"40","author":"R Ahuja","year":"1992","unstructured":"Ahuja R, Orlin J (1992) The scaling network simplex algorithm. Oper Res 40(1):5\u201313","journal-title":"Oper Res"},{"key":"9739_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: Hancock E, Vento M (eds) Proceedings of 4th International workshop on graph based representations in pattern recognition, LNCS 2726. Springer, pp 95\u2013106","DOI":"10.1007\/3-540-45028-9_9"},{"key":"9739_CR4","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1002\/net.3230130404","volume":"13","author":"D Avis","year":"1983","unstructured":"Avis D (1983) A survey of heuristics for the weighted matching problem. Networks 13:475\u2013493","journal-title":"Networks"},{"issue":"10","key":"9739_CR5","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1109\/34.954600","volume":"23","author":"S Berretti","year":"2001","unstructured":"Berretti S, Del Bimbo A, Vicario E (2001) Efficient matching and indexing of graph models in content-based retrieval. IEEE Trans Pattern Anal Mach Intell 23(10):1089\u20131105","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9739_CR6","doi-asserted-by":"crossref","unstructured":"Boeres M, Ribeiro C, Bloch I (2004) A randomized heuristic for scene recognition by graph matching. In: Ribeiro C, Martins S (eds) Proceedings of 3rd workshop on efficient and experimental algorithms, LNCS 3059. Springer, pp 100\u2013113","DOI":"10.1007\/978-3-540-24838-5_8"},{"issue":"1","key":"9739_CR7","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.patrec.2016.10.001","volume":"87","author":"S Bougleux","year":"2017","unstructured":"Bougleux S, Brun L, Carletti V, Foggia P, Gauzere B, Vento M (2017) Graph edit distance as a quadratic assignment problem. Pattern Recognit Lett 87(1):38\u201346","journal-title":"Pattern Recognit Lett"},{"key":"9739_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H Bunke","year":"1983","unstructured":"Bunke H, Allermann G (1983) Inexact graph matching for structural pattern recognition. Pattern Recognit Lett 1:245\u2013253","journal-title":"Pattern Recognit Lett"},{"key":"9739_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment problems","author":"R Burkard","year":"2009","unstructured":"Burkard R, Dell\u2019Amico M, Martello S (2009) Assignment problems. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA"},{"issue":"3","key":"9739_CR10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","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(3):265\u2013298","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"20","key":"9739_CR11","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L Cordella","year":"2004","unstructured":"Cordella L, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(20):1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"9739_CR12","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.patrec.2015.01.009","volume":"56","author":"X Cortes","year":"2015","unstructured":"Cortes X, Serratosa F (2015) Learning graph-matching edit-costs based on the optimality of the oracle\u2019s node correspondences. Pattern Recognit Lett 56:22\u201329","journal-title":"Pattern Recognit Lett"},{"issue":"3","key":"9739_CR13","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TSMC.1984.6313232","volume":"14","author":"M Eshera","year":"1984","unstructured":"Eshera M, Fu K (1984) A graph distance measure for image analysis. IEEE Trans Syst Man Cybern (Part B) 14(3):398\u2013408","journal-title":"IEEE Trans Syst Man Cybern (Part B)"},{"key":"9739_CR14","unstructured":"Eshera M, Fu K (1984) A similarity measure between attributed relational graphs for image analysis. In: Proceedings of 7th international confernece on pattern recognition, pp 75\u201377"},{"key":"9739_CR15","doi-asserted-by":"crossref","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) Proceedings of 8th international workshop on graph based representations in pattern recognition, LNCS 6658, pp 102\u2013111","DOI":"10.1007\/978-3-642-20844-7_11"},{"key":"9739_CR16","doi-asserted-by":"crossref","unstructured":"Fischer A, Plamandon R, Savaria Y, Riesen K, Bunke H (2014) A Hausdorff heuristic for efficient computation of graph edit distance. In: Fr\u00e4nti P, Brown G, Loog M, Escolano F, Pelillo M (eds) Proceedings of international workshop on structural and syntactic pattern recognition, LNCS 8621, pp 83\u201392","DOI":"10.1007\/978-3-662-44415-3_9"},{"issue":"1","key":"9739_CR17","doi-asserted-by":"crossref","first-page":"1450001","DOI":"10.1142\/S0218001414500013","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia P, Percannella G, Vento M (2014) Graph matching and learning in pattern recognition in the last 10 years. Int J Pattern Recognit Artif Intell 28(1):1450001","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"9739_CR18","first-page":"467","volume-title":"Graph kernels","author":"T G\u00e4rtner","year":"2010","unstructured":"G\u00e4rtner T, Horvath T, Wrobel S (2010) Graph kernels. Springer, Berlin, pp 467\u2013469"},{"key":"9739_CR19","unstructured":"Gauzere B, Bougleux S, Riesen K, Brun L (2014) Approximate graph edit distance guided by bipartite matching of bags of walks. In: Fr\u00e4nti P, Brown G, Loog M, Escolano F, Pelillo M (eds) Proceedings of international workshop on structural and syntactic pattern recognition, LNCS 8621, pp 73\u201382"},{"key":"9739_CR20","doi-asserted-by":"crossref","unstructured":"Gauzere B, Brun L, Villemin D (2011) Two new graph kernels and applications to chemoinformatics. In: Jiang X, Ferrer M, Torsello A (eds) Proceedings of 8th international workshop on graph based representations in pattern recognition, pp 112\u2013121","DOI":"10.1007\/978-3-642-20844-7_12"},{"key":"9739_CR21","doi-asserted-by":"crossref","unstructured":"Gregory L, Kittler J (2002) Using graph search techniques for contextual colour retrieval. In: Caelli T, Amin A, Duin R, Kamel M, de\u00a0Ridder D (eds) Proceedings of the joint IAPR international workshop on structural, syntactic, and statistical pattern recognition, LNCS 2396, pp 186\u2013194","DOI":"10.1007\/3-540-70659-3_19"},{"issue":"2","key":"9739_CR22","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P Hart","year":"1968","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","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"9739_CR23","doi-asserted-by":"crossref","unstructured":"Jones W, Chawdhary A, King A (2015) Revisiting volgenant-jonker for approximating graph edit distance. In: Liu C, Luo B, Kropatsch W, Cheng J (eds.) Proceedings of 10th international workshop on graph based representations in pattern recognition, LNCS 9069, pp 98\u2013107","DOI":"10.1007\/978-3-319-18224-7_10"},{"key":"9739_CR24","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker R, Volgenant A (1987) A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38:325\u2013340","journal-title":"Computing"},{"issue":"8","key":"9739_CR25","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1109\/TPAMI.2006.152","volume":"28","author":"D Justice","year":"2006","unstructured":"Justice D, Hero A (2006) A binary linear programming formulation of the graph edit distance. IEEE Trans Pattern Anal Ans Mach Intell 28(8):1200\u20131214","journal-title":"IEEE Trans Pattern Anal Ans Mach Intell"},{"key":"9739_CR26","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T Koopmans","year":"1975","unstructured":"Koopmans T, Beckmann M (1975) Assignment problems and the location of economic activities. Econometrica 25:53\u201376","journal-title":"Econometrica"},{"key":"9739_CR27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H Kuhn","year":"1955","unstructured":"Kuhn H (1955) The Hungarian method for the assignment problem. Nav Res Logist Q 2:83\u201397","journal-title":"Nav Res Logist Q"},{"issue":"8","key":"9739_CR28","first-page":"707","volume":"10","author":"V Levenshtein","year":"1966","unstructured":"Levenshtein V (1966) Binary codes capable of correcting deletions, insertions and reversals. Sov Phys Dokl 10(8):707\u2013710","journal-title":"Sov Phys Dokl"},{"issue":"1","key":"9739_CR29","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres J (1957) Algorithms for the assignment and transportation problems. J Soc Ind Appl Math 5(1):32\u201338","journal-title":"J Soc Ind Appl Math"},{"key":"9739_CR30","doi-asserted-by":"crossref","unstructured":"Neuhaus M, Bunke H (2004) A probabilistic approach to learning costs for graph edit distance. In: Kittler J, Petrou M, Nixon M (eds) Proceedings of 17th international conference on pattern recognition, 3, pp 389\u2013393","DOI":"10.1109\/ICPR.2004.1334548"},{"issue":"3","key":"9739_CR31","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 (Part B) 35(3):503\u2013514","journal-title":"IEEE Trans Syst Man Cybern (Part B)"},{"issue":"1","key":"9739_CR32","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":"9739_CR33","doi-asserted-by":"crossref","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 (2007) Bridging the gap between graph edit distance and kernel machines. World Scientific, Singapore"},{"key":"9739_CR34","doi-asserted-by":"crossref","unstructured":"Neuhaus M, Riesen K, Bunke H (2006) Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung DY, Kwok J, Fred A, Roli F, de\u00a0Ridder D (eds) Proceedings of 11th international workshop on strucural and syntactic pattern recognition, LNCS 4109, pp 163\u2013172","DOI":"10.1007\/11815921_17"},{"key":"9739_CR35","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/BFb0121050","volume":"24","author":"J Orlin","year":"1985","unstructured":"Orlin J (1985) On the simplex algorithm for networks and generalized networks. Math Program Stud 24:166\u2013178","journal-title":"Math Program Stud"},{"key":"9739_CR36","volume-title":"Structural pattern recognition with graph edit distance","author":"K Riesen","year":"2016","unstructured":"Riesen K (2016) Structural pattern recognition with graph edit distance. Springer, Berlin"},{"key":"9739_CR37","doi-asserted-by":"crossref","unstructured":"Riesen K, Bunke H (2008) IAM graph database repository for graph based pattern recognition and machine learning. In: da\u00a0Vitoria Lobo N\u00a0et al (ed) Structural, syntactic, and statistical pattern recognition, LNCS 5342, pp 287\u2013297","DOI":"10.1007\/978-3-540-89689-0_33"},{"issue":"4","key":"9739_CR38","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen K, Bunke H (2009) Approximate graph edit distance computation by means of bipartite graph matching. Image Vis Comput 27(4):950\u2013959","journal-title":"Image Vis Comput"},{"key":"9739_CR39","doi-asserted-by":"crossref","DOI":"10.1142\/7731","volume-title":"Graph classification and clustering based on vector space embedding","author":"K Riesen","year":"2010","unstructured":"Riesen K, Bunke H (2010) Graph classification and clustering based on vector space embedding. World Scientific, Singapore"},{"key":"9739_CR40","unstructured":"Riesen K, Fankhauser S, Bunke H (2007) Speeding up graph edit distance computation with a bipartite heuristic. In: Frasconi P, Kersting K, Tsuda K (eds) Proceedings of 5th international workshop on mining and learning with graphs, pp 21\u201324"},{"key":"9739_CR41","doi-asserted-by":"crossref","unstructured":"Riesen K, Ferrer M, Dornberger R, Bunke H (2015) Greedy graph edit distance. In: Perner P (ed) Proceedings 11th international conference on machine learning and data mining in pattern recognition, LNAI 9166, pp 1\u201314","DOI":"10.1007\/978-3-319-21024-7_1"},{"key":"9739_CR42","doi-asserted-by":"crossref","unstructured":"Riesen K, Ferrer M, Fischer A, Bunke H (2015) Approximation of graph edit distance in quadratic time. In: Liu C, Luo B, Kropatsch W, Cheng J (eds) Proceedings of 10th international workshop on graph based representations in pattern recognition, LNCS 9069, pp 3\u201312","DOI":"10.1007\/978-3-319-18224-7_1"},{"key":"9739_CR43","doi-asserted-by":"crossref","unstructured":"Riesen K, Fischer A, Bunke H (2014) Computing upper and lower bounds of graph edit distance in cubic time. In: Gayar N, Schwenker F, Suen C (eds) Proceedings of international workshop on artificial neural networks in pattern recognition, LNAI 8774, pp 129\u2013140","DOI":"10.1007\/978-3-319-11656-3_12"},{"key":"9739_CR44","doi-asserted-by":"crossref","unstructured":"Riesen K, Fischer A, Bunke H (2014) Improving graph edit distance approximation by centrality measures. In: Proceedings of 22nd international conference on pattern recognition, pp 3910\u20133914","DOI":"10.1109\/ICPR.2014.670"},{"key":"9739_CR45","doi-asserted-by":"crossref","unstructured":"Riesen K, Fischer A, Bunke H (2016) Approximation of graph edit distance by means of a utility matrix. In: Schwenker F, Abbas H, El\u00a0Gayar N, Trentin E (eds) Proceedings of 7th IAPR TC3 workshop on artificial neural networks in pattern recognition, LNCS 9896. Springer, pp 185\u2013194","DOI":"10.1007\/978-3-319-46182-3_16"},{"key":"9739_CR46","doi-asserted-by":"crossref","unstructured":"Riesen K, Neuhaus M, Bunke H (2007) Bipartite graph matching for computing the edit distance of graphs. In: Escolano F, Vento M (eds) Proceedings of 6th international workshop on graph based representations in pattern recognition, LNCS 4538, pp 1\u201312","DOI":"10.1007\/978-3-540-72903-7_1"},{"key":"9739_CR47","doi-asserted-by":"crossref","unstructured":"Rossi L, Torsello A, Hancock E (2013) A continuous-time quantum walk kernel for unattributed graphs. In: Kropatsch W, Artner N, Haxhimusa Y, Jiang X (eds) Proceedings of 9th international workshop on graph based representations in pattern recognition, pp 101\u2013110","DOI":"10.1007\/978-3-642-38221-5_11"},{"issue":"3","key":"9739_CR48","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu A, Fu K (1983) A distance measure between attributed relational graphs for pattern recognition. IEEE Trans Syst Man Cybern (Part B) 13(3):353\u2013363","journal-title":"IEEE Trans Syst Man Cybern (Part B)"},{"issue":"6","key":"9739_CR49","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"S Selkow","year":"1977","unstructured":"Selkow S (1977) The tree-to-tree editing problem. Inf Process Lett 6(6):184\u2013186","journal-title":"Inf Process Lett"},{"key":"9739_CR50","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.patrec.2014.04.015","volume":"45","author":"F Serratosa","year":"2014","unstructured":"Serratosa F (2014) Fast computation of bipartite graph matching. Pattern Recognit Lett 45:244\u2013250","journal-title":"Pattern Recognit Lett"},{"issue":"2","key":"9739_CR51","doi-asserted-by":"crossref","first-page":"1550010","DOI":"10.1142\/S021800141550010X","volume":"29","author":"F Serratosa","year":"2015","unstructured":"Serratosa F (2015) Speeding up fast bipartite graph matching through a new cost matrix. Int J Pattern Recognit Artif Intell 29(2):1550010","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"5","key":"9739_CR52","first-page":"126","volume":"26","author":"F Serratosa","year":"2012","unstructured":"Serratosa F, Cort\u00e9s X, Sol\u00e9-Ribalta A (2012) On the graph edit distance cost: properties and applications. Int J Pattern Recognit Artif Intell 26(5):126","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"9739_CR53","doi-asserted-by":"crossref","unstructured":"Serratosa F, Sol\u00e9-Ribalta A, Cortes X (2011) Automatic learning of edit costs based on interactive and adaptive graph recognition. In: Jiang X, Ferrer M, Torsello A (eds) Proceedings of 8th international workshop on graph based representations in pattern recognition, LNCS 6658, pp 152\u2013163","DOI":"10.1007\/978-3-642-20844-7_16"},{"key":"9739_CR54","doi-asserted-by":"crossref","unstructured":"Sorlin S, Solnon C (2005) Reactive tabu search for measuring graph similarity. In: Brun L, Vento M (eds) Proceedings of 5th international workshop on graph-based representations in pattern recognition, LNCS 3434. Springer, pp 172\u2013182","DOI":"10.1007\/978-3-540-31988-7_16"},{"key":"9739_CR55","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/BF01593805","volume":"12","author":"V Srinivasan","year":"1977","unstructured":"Srinivasan V, Thompson G (1977) Cost operator algorithms for the transportation problem. Math Program 12:372\u2013391","journal-title":"Math Program"},{"issue":"12","key":"9739_CR56","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/TSMC.1979.4310127","volume":"9","author":"W Tsai","year":"1979","unstructured":"Tsai W, Fu K (1979) Error-correcting isomorphism of attributed relational graphs for pattern analysis. IEEE Trans Syst Man Cybern (Part B) 9(12):757\u2013768","journal-title":"IEEE Trans Syst Man Cybern (Part B)"},{"key":"9739_CR57","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TSMC.1983.6313029","volume":"13","author":"W Tsai","year":"1983","unstructured":"Tsai W, Fu K (1983) Subgraph error-correcting isomorphisms for syntactic pattern recognition. IEEE Trans Syst Man Cybern (Part B) 13:48\u201361","journal-title":"IEEE Trans Syst Man Cybern (Part B)"},{"issue":"1","key":"9739_CR58","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner RA, Fischer MJ (1974) The string-to-string correction problem. J Assoc Comput Mach 21(1):168\u2013173","journal-title":"J Assoc Comput Mach"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11063-017-9739-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-017-9739-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-017-9739-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T18:30:30Z","timestamp":1570300230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11063-017-9739-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,9]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9739"],"URL":"https:\/\/doi.org\/10.1007\/s11063-017-9739-7","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"type":"print","value":"1370-4621"},{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[2017,11,9]]}}}