{"id":"https://openalex.org/W4417484913","doi":"https://doi.org/10.1145/3769534.3769546","title":"A Dynamic Multi-hop Attention Integrated Graph Neural Network for Subgraph Matching","display_name":"A Dynamic Multi-hop Attention Integrated Graph Neural Network for Subgraph Matching","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W4417484913","doi":"https://doi.org/10.1145/3769534.3769546"},"language":null,"primary_location":{"id":"doi:10.1145/3769534.3769546","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3769534.3769546","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 18th International Symposium on Visual Information Communication and Interaction","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3769534.3769546","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058348361","display_name":"S. H. Zhang","orcid":"https://orcid.org/0009-0004-8799-610X"},"institutions":[{"id":"https://openalex.org/I137056471","display_name":"Nanjing University of Finance and Economics","ror":"https://ror.org/031y8am81","country_code":"CN","type":"education","lineage":["https://openalex.org/I137056471"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Siting Zhang","raw_affiliation_strings":["School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China"],"raw_orcid":"https://orcid.org/0009-0004-8799-610X","affiliations":[{"raw_affiliation_string":"School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China","institution_ids":["https://openalex.org/I137056471"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107954525","display_name":"Yufeng Liu","orcid":"https://orcid.org/0000-0002-7763-5552"},"institutions":[{"id":"https://openalex.org/I137056471","display_name":"Nanjing University of Finance and Economics","ror":"https://ror.org/031y8am81","country_code":"CN","type":"education","lineage":["https://openalex.org/I137056471"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yufeng Liu","raw_affiliation_strings":["School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0002-7763-5552","affiliations":[{"raw_affiliation_string":"School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China","institution_ids":["https://openalex.org/I137056471"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044374255","display_name":"Y. Qu","orcid":"https://orcid.org/0009-0006-6290-7179"},"institutions":[{"id":"https://openalex.org/I137056471","display_name":"Nanjing University of Finance and Economics","ror":"https://ror.org/031y8am81","country_code":"CN","type":"education","lineage":["https://openalex.org/I137056471"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuefei Qu","raw_affiliation_strings":["School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China"],"raw_orcid":"https://orcid.org/0009-0006-6290-7179","affiliations":[{"raw_affiliation_string":"School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China","institution_ids":["https://openalex.org/I137056471"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066266891","display_name":"Jun Wu","orcid":"https://orcid.org/0000-0003-1765-4409"},"institutions":[{"id":"https://openalex.org/I137056471","display_name":"Nanjing University of Finance and Economics","ror":"https://ror.org/031y8am81","country_code":"CN","type":"education","lineage":["https://openalex.org/I137056471"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jun Wu","raw_affiliation_strings":["School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0003-1765-4409","affiliations":[{"raw_affiliation_string":"School of Computer and Artificial Intelligence, Nanjing University of Finance and Economics, Nanjing, China","institution_ids":["https://openalex.org/I137056471"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I137056471"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.6650999784469604,"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.6650999784469604,"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.3012999892234802,"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/T11719","display_name":"Data Quality and Management","score":0.0044999998062849045,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.65420001745224},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.5349000096321106},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5303999781608582},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5098000168800354},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4090000092983246},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3427000045776367},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3411000072956085},{"id":"https://openalex.org/keywords/attention-network","display_name":"Attention network","score":0.33820000290870667},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.3321000039577484}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6920999884605408},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.65420001745224},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5349000096321106},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5303999781608582},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5098000168800354},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.44519999623298645},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.427700012922287},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4090000092983246},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3555999994277954},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3411000072956085},{"id":"https://openalex.org/C2993807640","wikidata":"https://www.wikidata.org/wiki/Q103709453","display_name":"Attention network","level":2,"score":0.33820000290870667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33239999413490295},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C33954974","wikidata":"https://www.wikidata.org/wiki/Q486494","display_name":"Sensor fusion","level":2,"score":0.3273000121116638},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3174000084400177},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.3089999854564667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30889999866485596},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3003999888896942},{"id":"https://openalex.org/C13540734","wikidata":"https://www.wikidata.org/wiki/Q5318996","display_name":"Dynamic network analysis","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.2870999872684479},{"id":"https://openalex.org/C158525013","wikidata":"https://www.wikidata.org/wiki/Q2593739","display_name":"Fusion","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C52622490","wikidata":"https://www.wikidata.org/wiki/Q1026626","display_name":"Feature extraction","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.2644999921321869},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.25839999318122864},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2574000060558319},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3769534.3769546","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3769534.3769546","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 18th International Symposium on Visual Information Communication and Interaction","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3769534.3769546","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3769534.3769546","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 18th International Symposium on Visual Information Communication and Interaction","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1543180643","https://openalex.org/W2035173902","https://openalex.org/W2048653843","https://openalex.org/W2100586946","https://openalex.org/W2112200469","https://openalex.org/W2116341502","https://openalex.org/W2140840007","https://openalex.org/W2147405597","https://openalex.org/W2147913014","https://openalex.org/W2247894828","https://openalex.org/W2423652555","https://openalex.org/W2613146847","https://openalex.org/W2810284163","https://openalex.org/W2906943923","https://openalex.org/W2948359422","https://openalex.org/W2948742909","https://openalex.org/W3008054143","https://openalex.org/W3093996209","https://openalex.org/W4295197121","https://openalex.org/W4385484699","https://openalex.org/W4389131280","https://openalex.org/W4391543346","https://openalex.org/W4394698829","https://openalex.org/W4399163935","https://openalex.org/W4402436218"],"related_works":[],"abstract_inverted_index":{"Subgraph":[0],"matching":[1,31,40,160],"is":[2,101,133],"a":[3,95,127],"nonnegligible":[4],"task":[5],"in":[6,15,47],"graph":[7],"data":[8],"analysis":[9],"and":[10,20,109,117,141],"has":[11],"been":[12],"widely":[13],"applied":[14],"domains":[16],"such":[17],"as":[18],"bioinformatics":[19],"computer":[21],"vision.":[22],"Owing":[23],"to":[24,35,103,135],"its":[25],"NP-hard":[26],"nature,":[27],"most":[28],"existing":[29],"subgraph":[30],"methods":[32],"are":[33,76,149],"forced":[34],"balance":[36,105],"computational":[37,164],"efficiency":[38],"with":[39,162],"accuracy,":[41],"often":[42],"compromising":[43],"deep":[44],"structural":[45,123],"information":[46],"large-scale":[48],"graphs.":[49],"To":[50],"handle":[51],"this":[52,54],"problem,":[53],"paper":[55],"proposes":[56],"an":[57,80],"integrated":[58],"model":[59],"named":[60],"Dynamic":[61],"Multi-hop":[62],"Attention":[63],"Graph":[64],"Neural":[65],"Network":[66],"(DyMA-GNN).":[67],"In":[68,125],"DyMA-GNN,":[69],"the":[70,92,106,138,143,146,167],"attention":[71,98],"weights":[72],"of":[73,145],"neighboring":[74],"nodes":[75],"dynamically":[77],"assigned":[78],"through":[79],"adaptive":[81,93],"node":[82],"weight":[83],"learning":[84],"mechanism,":[85,94],"rather":[86],"than":[87,166],"fixed":[88],"rules.":[89],"Based":[90],"on":[91,151],"dynamic":[96],"multi-hop":[97,110],"fusion":[99],"framework":[100],"designed":[102],"hierarchically":[104],"initial":[107],"features":[108],"aggregated":[111],"features,":[112],"effectively":[113,136],"capturing":[114],"higher-order":[115],"dependencies":[116],"long-range":[118],"connections":[119],"while":[120],"preserving":[121],"local":[122],"information.":[124],"addition,":[126],"composite":[128],"loss":[129],"function":[130],"optimization":[131],"strategy":[132],"defined":[134],"suppress":[137],"noise":[139],"interference":[140],"enhance":[142],"robustness":[144],"model.":[147],"Experiments":[148],"conducted":[150],"real":[152],"datasets":[153],"from":[154],"three":[155],"different":[156],"fields,":[157],"achieving":[158],"higher":[159],"accuracy":[161],"less":[163],"cost":[165],"state-of-the-art":[168],"baseline":[169],"methods.":[170]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-12-19T00:00:00"}
