{"id":"https://openalex.org/W3086320659","doi":"https://doi.org/10.1109/hpcs48598.2019.9188094","title":"End-to-End Learning of Graph Similarity","display_name":"End-to-End Learning of Graph Similarity","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W3086320659","doi":"https://doi.org/10.1109/hpcs48598.2019.9188094","mag":"3086320659"},"language":"en","primary_location":{"id":"doi:10.1109/hpcs48598.2019.9188094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"},"type":"article","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/A5100345045","display_name":"Zhixin Chen","orcid":"https://orcid.org/0000-0001-6453-0447"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhixin Chen","raw_affiliation_strings":["State Key Laboratory of Software Development Environment, School of Mechanical Engineering and Automation, Beihang University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Software Development Environment, School of Mechanical Engineering and Automation, Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008027442","display_name":"Mengxiang Lin","orcid":"https://orcid.org/0000-0003-2908-4597"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Mengxiang Lin","raw_affiliation_strings":["State Key Laboratory of Software Development Environment, School of Mechanical Engineering and Automation, Beihang University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Software Development Environment, School of Mechanical Engineering and Automation, Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100612161","display_name":"Deqing Wang","orcid":"https://orcid.org/0000-0001-6441-4390"},"institutions":[{"id":"https://openalex.org/I82880672","display_name":"Beihang University","ror":"https://ror.org/00wk2mp56","country_code":"CN","type":"education","lineage":["https://openalex.org/I82880672"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Deqing Wang","raw_affiliation_strings":["State Key Laboratory of Software Development Environment, School of Mechanical Engineering and Automation, Beihang University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Software Development Environment, School of Mechanical Engineering and Automation, Beihang University, Beijing, China","institution_ids":["https://openalex.org/I82880672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100345045"],"corresponding_institution_ids":["https://openalex.org/I82880672"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24413356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22 8","issue":null,"first_page":"528","last_page":"534"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9998000264167786,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.714283287525177},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6367180347442627},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.6238919496536255},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.522199809551239},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5201092958450317},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4542430639266968},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4135951101779938},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39342987537384033},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38568371534347534},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.34681153297424316},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3248433470726013},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.11685273051261902}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.714283287525177},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6367180347442627},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.6238919496536255},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.522199809551239},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5201092958450317},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4542430639266968},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4135951101779938},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39342987537384033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38568371534347534},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.34681153297424316},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3248433470726013},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.11685273051261902}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcs48598.2019.9188094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs48598.2019.9188094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1492230849","https://openalex.org/W1614298861","https://openalex.org/W1849803292","https://openalex.org/W1963920197","https://openalex.org/W1976196182","https://openalex.org/W1991730503","https://openalex.org/W2012459404","https://openalex.org/W2053841470","https://openalex.org/W2127426251","https://openalex.org/W2132022337","https://openalex.org/W2141629057","https://openalex.org/W2148762636","https://openalex.org/W2152618599","https://openalex.org/W2170607286","https://openalex.org/W2172501726","https://openalex.org/W2173027866","https://openalex.org/W2250539671","https://openalex.org/W2299115575","https://openalex.org/W2569502005","https://openalex.org/W2607500032","https://openalex.org/W2615384791","https://openalex.org/W2761896323","https://openalex.org/W2801588504","https://openalex.org/W2801835932","https://openalex.org/W2886034153","https://openalex.org/W2950822063","https://openalex.org/W2964015378","https://openalex.org/W2964113829","https://openalex.org/W3103995645","https://openalex.org/W4293282039","https://openalex.org/W4297571622","https://openalex.org/W6636510571","https://openalex.org/W6675494782","https://openalex.org/W6678846912","https://openalex.org/W6679191575","https://openalex.org/W6697873463","https://openalex.org/W6726873649","https://openalex.org/W6731467248"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W2368606575","https://openalex.org/W4246757943","https://openalex.org/W2085998272","https://openalex.org/W2132753198","https://openalex.org/W2369874856","https://openalex.org/W2182477562","https://openalex.org/W2792185758","https://openalex.org/W2536030737"],"abstract_inverted_index":{"Constructing":[0],"and":[1,48],"calculating":[2],"the":[3,14,30,39,59,69,73,99,128,132,141,148],"metrics":[4,31],"of":[5,41,64,76,101,110,114],"graphs":[6,42,77],"comparison":[7],"precisely":[8],"can":[9],"be":[10],"expensive":[11],"due":[12],"to":[13,28,57,97,112],"prohibitively":[15],"high":[16],"time":[17,123],"complexity,":[18],"exponential":[19],"in":[20,89,104,131,147],"some":[21],"cases.":[22],"Thus":[23],"building":[24],"a":[25,45,82],"learning":[26,46],"model":[27,56,71,103,118],"approximate":[29],"is":[32,95],"expected.":[33],"In":[34,66],"this":[35,67],"paper,":[36],"we":[37],"convert":[38],"computation":[40],"similarity/distance":[43],"into":[44],"problem":[47],"propose":[49],"an":[50],"end-to-end":[51],"GCN(Graph":[52],"Convolutional":[53],"Network)":[54],"based":[55],"calculate":[58],"GFD(Graphlet":[60],"Frequency":[61],"Distribution)":[62],"distance":[63,75],"graphs.":[65],"way,":[68],"trained":[70,117],"predicts":[72],"GFD":[74,83],"directly":[78],"rather":[79],"than":[80],"constructs":[81],"vector":[84],"by":[85],"counting":[86],"graphlets":[87],"as":[88],"traditional":[90],"methods.":[91],"A":[92],"experimental":[93],"evaluation":[94],"conducted":[96],"validate":[98],"effectiveness":[100],"our":[102],"real-world":[105],"networks":[106],"scaled":[107],"from":[108],"tens":[109],"nodes":[111],"thousands":[113],"nodes.":[115],"Our":[116],"takes":[119],"$":[120],"480\\times$":[121],"less":[122],"on":[124],"average":[125],"compared":[126],"with":[127],"count-based":[129],"method":[130],"dataset.":[133],"The":[134],"3-top":[135],"nearest":[136,143],"accuracy":[137,144],"reaches":[138,145],"74.6%":[139],"while":[140],"5-top":[142],"85.2%":[146],"test":[149],"data.":[150]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}