{"id":"https://openalex.org/W4236682707","doi":"https://doi.org/10.1109/icpr.2004.1334548","title":"A probabilistic approach to learning costs for graph edit distance","display_name":"A probabilistic approach to learning costs for graph edit distance","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4236682707","doi":"https://doi.org/10.1109/icpr.2004.1334548"},"language":"en","primary_location":{"id":"doi:10.1109/icpr.2004.1334548","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2004.1334548","pdf_url":null,"source":{"id":"https://openalex.org/S4363608750","display_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058558072","display_name":"Michel Neuhaus","orcid":null},"institutions":[{"id":"https://openalex.org/I118564535","display_name":"University of Bern","ror":"https://ror.org/02k7v4d05","country_code":"CH","type":"education","lineage":["https://openalex.org/I118564535"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"M. Neuhaus","raw_affiliation_strings":["Dept. of Comput. Sci., Bern Univ., Switzerland","Department of Computer Science, University of Bern, Bern, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci., Bern Univ., Switzerland","institution_ids":["https://openalex.org/I118564535"]},{"raw_affiliation_string":"Department of Computer Science, University of Bern, Bern, Switzerland","institution_ids":["https://openalex.org/I118564535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111680161","display_name":"Horst Bunke","orcid":null},"institutions":[{"id":"https://openalex.org/I118564535","display_name":"University of Bern","ror":"https://ror.org/02k7v4d05","country_code":"CH","type":"education","lineage":["https://openalex.org/I118564535"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"H. Bunke","raw_affiliation_strings":["Dept. of Comput. Sci., Bern Univ., Switzerland","Department of Computer Science, University of Bern, Bern, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci., Bern Univ., Switzerland","institution_ids":["https://openalex.org/I118564535"]},{"raw_affiliation_string":"Department of Computer Science, University of Bern, Bern, Switzerland","institution_ids":["https://openalex.org/I118564535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I118564535"],"apc_list":null,"apc_paid":null,"fwci":1.4269,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.82136999,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"389","last_page":"393 Vol.3"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9772999882698059,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.8155823945999146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7438761591911316},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5306776165962219},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5244648456573486},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4911501109600067},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4219762980937958},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.41557157039642334},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3992689549922943},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38476112484931946},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3411466181278229},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30215054750442505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18919682502746582},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1388421654701233}],"concepts":[{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.8155823945999146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7438761591911316},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5306776165962219},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5244648456573486},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4911501109600067},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4219762980937958},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41557157039642334},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3992689549922943},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38476112484931946},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3411466181278229},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30215054750442505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18919682502746582},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1388421654701233}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpr.2004.1334548","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2004.1334548","pdf_url":null,"source":{"id":"https://openalex.org/S4363608750","display_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1512849174","https://openalex.org/W1565768210","https://openalex.org/W1570876803","https://openalex.org/W1963678392","https://openalex.org/W1981367467","https://openalex.org/W2010541316","https://openalex.org/W2012459404","https://openalex.org/W2046509566","https://openalex.org/W2049633694","https://openalex.org/W2051224630","https://openalex.org/W2052381559","https://openalex.org/W2053742104","https://openalex.org/W2071910845","https://openalex.org/W2085487226","https://openalex.org/W2098109165","https://openalex.org/W2102443632","https://openalex.org/W2122929441","https://openalex.org/W2136761100","https://openalex.org/W2152132697","https://openalex.org/W2163329495","https://openalex.org/W2165835775"],"related_works":["https://openalex.org/W3044917232","https://openalex.org/W1498160656","https://openalex.org/W2119149496","https://openalex.org/W2055693471","https://openalex.org/W4295101776","https://openalex.org/W2139858675","https://openalex.org/W2952580779","https://openalex.org/W1537327044","https://openalex.org/W123129858","https://openalex.org/W2163814182"],"abstract_inverted_index":{"Graph":[0],"edit":[1,16,28,45,68,80,102],"distance":[2,17,81,91],"provides":[3],"an":[4,52],"error-tolerant":[5],"way":[6],"to":[7,56,95],"measure":[8],"distances":[9],"between":[10],"attributed":[11],"graphs.":[12],"The":[13],"effectiveness":[14],"of":[15,27,44,64,77,88],"based":[18,39],"graph":[19,79],"classification":[20],"algorithms":[21],"relies":[22],"on":[23,40],"the":[24,75,86,89],"adequate":[25],"definition":[26],"operation":[29],"costs.":[30,103],"We":[31,84],"propose":[32],"a":[33,41,61,78],"cost":[34],"inference":[35],"method":[36],"that":[37,70],"is":[38],"distribution":[42],"estimation":[43],"operations.":[46],"For":[47],"this":[48],"purpose,":[49],"we":[50],"employ":[51],"expectation":[53],"maximization":[54],"algorithm":[55],"learn":[57],"mixture":[58],"densities":[59],"from":[60],"labeled":[62],"sample":[63],"graphs":[65],"and":[66],"derive":[67],"costs":[69],"are":[71],"subsequently":[72],"applied":[73],"in":[74,93],"context":[76],"computation":[82],"framework.":[83],"evaluate":[85],"performance":[87],"proposed":[90],"model":[92,100],"comparison":[94],"another":[96],"recently":[97],"introduced":[98],"learning":[99],"for":[101]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}