{"id":"https://openalex.org/W2604109958","doi":"https://doi.org/10.1145/3038912.3052561","title":"Neighbor-Aware Search for Approximate Labeled Graph Matching using the Chi-Square Statistics","display_name":"Neighbor-Aware Search for Approximate Labeled Graph Matching using the Chi-Square Statistics","publication_year":2017,"publication_date":"2017-04-03","ids":{"openalex":"https://openalex.org/W2604109958","doi":"https://doi.org/10.1145/3038912.3052561","mag":"2604109958"},"language":"en","primary_location":{"id":"doi:10.1145/3038912.3052561","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3038912.3052561","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th International Conference on World Wide Web","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3038912.3052561","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053023517","display_name":"Sourav Dutta","orcid":"https://orcid.org/0000-0002-8934-9166"},"institutions":[{"id":"https://openalex.org/I4210105201","display_name":"Nokia (Ireland)","ror":"https://ror.org/01dcaj468","country_code":"IE","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I4210105201"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Sourav Dutta","raw_affiliation_strings":["Nokia Bell Labs, Dublin, Ireland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nokia Bell Labs, Dublin, Ireland","institution_ids":["https://openalex.org/I4210105201"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052754409","display_name":"Pratik Nayek","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pratik Nayek","raw_affiliation_strings":["Microsoft Development Center, Bengaluru, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Development Center, Bengaluru, India","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103014125","display_name":"Arnab Bhattacharya","orcid":"https://orcid.org/0000-0001-7331-0788"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Arnab Bhattacharya","raw_affiliation_strings":["Indian Institute of Technology, Kanpur, Kanpur, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Kanpur, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2932,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.87946022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1281","last_page":"1290"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9987999796867371,"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.9955000281333923,"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/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.704541802406311},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.656006932258606},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5099786520004272},{"id":"https://openalex.org/keywords/statistic","display_name":"Statistic","score":0.5041900873184204},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4886825382709503},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47579821944236755},{"id":"https://openalex.org/keywords/outlier","display_name":"Outlier","score":0.4521515369415283},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.44896721839904785},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4326106011867523},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.43081629276275635},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.41754886507987976},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3690188229084015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3580448031425476},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32341140508651733},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2917783856391907},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16307061910629272},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09715482592582703}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.704541802406311},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.656006932258606},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5099786520004272},{"id":"https://openalex.org/C89128539","wikidata":"https://www.wikidata.org/wiki/Q1949963","display_name":"Statistic","level":2,"score":0.5041900873184204},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4886825382709503},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47579821944236755},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.4521515369415283},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.44896721839904785},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4326106011867523},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.43081629276275635},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.41754886507987976},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3690188229084015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3580448031425476},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32341140508651733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2917783856391907},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16307061910629272},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09715482592582703},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3038912.3052561","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3038912.3052561","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th International Conference on World Wide Web","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3038912.3052561","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3038912.3052561","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th International Conference on World Wide Web","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W24143670","https://openalex.org/W169140825","https://openalex.org/W1499160059","https://openalex.org/W1509240356","https://openalex.org/W1605319014","https://openalex.org/W1870593122","https://openalex.org/W1894439495","https://openalex.org/W1972243925","https://openalex.org/W1974908368","https://openalex.org/W1975068437","https://openalex.org/W1977866540","https://openalex.org/W1997219719","https://openalex.org/W2011595414","https://openalex.org/W2012066443","https://openalex.org/W2013497015","https://openalex.org/W2013729009","https://openalex.org/W2019827052","https://openalex.org/W2022166150","https://openalex.org/W2029237417","https://openalex.org/W2036265926","https://openalex.org/W2048653843","https://openalex.org/W2056124433","https://openalex.org/W2069543418","https://openalex.org/W2071333487","https://openalex.org/W2081985429","https://openalex.org/W2082134159","https://openalex.org/W2083235381","https://openalex.org/W2095319945","https://openalex.org/W2100080493","https://openalex.org/W2101511590","https://openalex.org/W2102913801","https://openalex.org/W2109294083","https://openalex.org/W2111036405","https://openalex.org/W2112200469","https://openalex.org/W2120589018","https://openalex.org/W2123966888","https://openalex.org/W2125589825","https://openalex.org/W2126359798","https://openalex.org/W2131792733","https://openalex.org/W2136593687","https://openalex.org/W2140840007","https://openalex.org/W2142491343","https://openalex.org/W2145631416","https://openalex.org/W2147405597","https://openalex.org/W2147913014","https://openalex.org/W2152609228","https://openalex.org/W2154682196","https://openalex.org/W2154808355","https://openalex.org/W2159205500","https://openalex.org/W2164814636","https://openalex.org/W2167222948","https://openalex.org/W2170726034","https://openalex.org/W2221999674","https://openalex.org/W2295570185","https://openalex.org/W2305613814","https://openalex.org/W2409645877","https://openalex.org/W2903174694","https://openalex.org/W3192290435","https://openalex.org/W4294841944","https://openalex.org/W6682832507","https://openalex.org/W6684171462"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W2886672068","https://openalex.org/W167435155","https://openalex.org/W2566098902","https://openalex.org/W1887488684","https://openalex.org/W2750614246","https://openalex.org/W231720905","https://openalex.org/W872425053","https://openalex.org/W2604114816","https://openalex.org/W3151217588"],"abstract_inverted_index":{"Labeled":[0],"graphs":[1,18],"provide":[2],"a":[3,65,73,135,145],"natural":[4],"way":[5],"of":[6,47,53,105,181],"representing":[7],"entities,":[8],"relationships":[9],"and":[10,19,29,41,50,67,99,119,131,154,161,183],"structures":[11],"within":[12],"real":[13],"datasets":[14,175],"such":[15,23],"as":[16,24],"knowledge":[17],"protein":[20],"interactions.":[21],"Applications":[22],"question":[25],"answering,":[26],"semantic":[27],"search,":[28],"motif":[30],"discovery":[31],"entail":[32],"efficient":[33],"approaches":[34],"for":[35,164],"subgraph":[36,48,79,112],"matching":[37,57,111],"involving":[38],"both":[39],"label":[40,100,118,168],"structural":[42,120],"similarities.":[43],"Given":[44],"the":[45,51,78,96,103,109,124,139,189],"NP-completeness":[46],"isomorphism":[49],"presence":[52],"noise,":[54,157],"approximate":[55],"graph":[56,174],"techniques":[58],"are":[59],"required":[60],"to":[61,76,107,156,188],"handle":[62],"queries":[63],"in":[64,102,179,186],"robust":[66,155],"real-time":[68],"manner.":[69],"This":[70],"paper":[71],"presents":[72],"novel":[74],"technique":[75],"characterize":[77],"similarity":[80],"based":[81],"on":[82,123,171],"statistical":[83,90],"significance":[84,91],"captured":[85],"by":[86],"chi-square":[87],"statistic.":[88],"The":[89],"model":[92],"takes":[93],"into":[94],"account":[95],"background":[97],"structure":[98],"distribution":[101],"neighborhood":[104],"vertices":[106],"obtain":[108],"best":[110],"and,":[113],"therefore,":[114],"robustly":[115],"handles":[116],"partial":[117],"mismatches.":[121],"Based":[122],"model,":[125],"we":[126],"propose":[127],"two":[128],"algorithms,":[129],"VELSET":[130,150],"NAGA,":[132],"that,":[133],"given":[134],"query":[136],"graph,":[137],"return":[138],"top-k":[140],"most":[141],"similar":[142],"subgraphs":[143],"from":[144],"(large)":[146],"database":[147],"graph.":[148],"While":[149],"is":[151,159],"more":[152,162],"accurate":[153],"NAGA":[158],"faster":[160],"applicable":[163],"scenarios":[165],"with":[166],"low":[167],"noise.":[169],"Experiments":[170],"large":[172],"real-life":[173],"depict":[176],"significant":[177],"improvements":[178],"terms":[180],"accuracy":[182],"running":[184],"time":[185],"comparison":[187],"state-of-the-art":[190],"methods.":[191]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}