{"id":"https://openalex.org/W4396554357","doi":"https://doi.org/10.5220/0012724000003708","title":"FaRS: A High-Performance Automorphism-Aware Algorithm for Graph Similarity Matching","display_name":"FaRS: A High-Performance Automorphism-Aware Algorithm for Graph Similarity Matching","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4396554357","doi":"https://doi.org/10.5220/0012724000003708"},"language":"en","primary_location":{"id":"doi:10.5220/0012724000003708","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0012724000003708","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th International Conference on Complexity, Future Information Systems and Risk","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0012724000003708","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100380550","display_name":"Fan Wang","orcid":"https://orcid.org/0000-0003-0100-0320"},"institutions":[{"id":"https://openalex.org/I169199633","display_name":"Aston University","ror":"https://ror.org/05j0ve876","country_code":"GB","type":"education","lineage":["https://openalex.org/I169199633"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Fan Wang","raw_affiliation_strings":["Aston University, Birmingham B4 7ET, U.K., --- Select a Country ---"],"affiliations":[{"raw_affiliation_string":"Aston University, Birmingham B4 7ET, U.K., --- Select a Country ---","institution_ids":["https://openalex.org/I169199633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102858336","display_name":"Weiren Yu","orcid":"https://orcid.org/0000-0002-1082-9475"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Weiren Yu","raw_affiliation_strings":["University of Warwick CV4 7AL, U.K., --- Select a Country ---"],"affiliations":[{"raw_affiliation_string":"University of Warwick CV4 7AL, U.K., --- Select a Country ---","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011766117","display_name":"Hai Wang","orcid":"https://orcid.org/0000-0002-4192-5363"},"institutions":[{"id":"https://openalex.org/I169199633","display_name":"Aston University","ror":"https://ror.org/05j0ve876","country_code":"GB","type":"education","lineage":["https://openalex.org/I169199633"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hai Wang","raw_affiliation_strings":["Aston University, Birmingham B4 7ET, U.K., --- Select a Country ---"],"affiliations":[{"raw_affiliation_string":"Aston University, Birmingham B4 7ET, U.K., --- Select a Country ---","institution_ids":["https://openalex.org/I169199633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064078720","display_name":"Victor Chang","orcid":"https://orcid.org/0000-0002-8012-5852"},"institutions":[{"id":"https://openalex.org/I169199633","display_name":"Aston University","ror":"https://ror.org/05j0ve876","country_code":"GB","type":"education","lineage":["https://openalex.org/I169199633"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Victor Chang","raw_affiliation_strings":["Aston University, Birmingham B4 7ET, U.K., --- Select a Country ---"],"affiliations":[{"raw_affiliation_string":"Aston University, Birmingham B4 7ET, U.K., --- Select a Country ---","institution_ids":["https://openalex.org/I169199633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100380550"],"corresponding_institution_ids":["https://openalex.org/I169199633"],"apc_list":null,"apc_paid":null,"fwci":0.2468,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47398301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"17","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9919999837875366,"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.9919999837875366,"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.9915000200271606,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9546999931335449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6625118255615234},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5745034217834473},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5737432241439819},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5150260925292969},{"id":"https://openalex.org/keywords/graph-automorphism","display_name":"Graph automorphism","score":0.4568496644496918},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.42193326354026794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3787756860256195},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3503376245498657},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24177896976470947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22617515921592712},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11535581946372986},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.1143057644367218},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.07921138405799866},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06030470132827759}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6625118255615234},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5745034217834473},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5737432241439819},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5150260925292969},{"id":"https://openalex.org/C6049932","wikidata":"https://www.wikidata.org/wiki/Q834981","display_name":"Graph automorphism","level":5,"score":0.4568496644496918},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.42193326354026794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3787756860256195},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3503376245498657},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24177896976470947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22617515921592712},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11535581946372986},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.1143057644367218},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07921138405799866},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06030470132827759}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5220/0012724000003708","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0012724000003708","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th International Conference on Complexity, Future Information Systems and Risk","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.aston.ac.uk:48658","is_oa":true,"landing_page_url":"https://publications.aston.ac.uk/view/author/cd44b58b0ccccba84929581d7e343a67.html>","pdf_url":"https://publications.aston.ac.uk/id/eprint/48658/1/FaRS_-_A_High-Performance_Automorphism-Aware_Algorithm_for_Graph_Similarity_Matching.pdf","source":{"id":"https://openalex.org/S4306400483","display_name":"Aston Publications Explorer (Aston University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169199633","host_organization_name":"Aston University","host_organization_lineage":["https://openalex.org/I169199633"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"}],"best_oa_location":{"id":"doi:10.5220/0012724000003708","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0012724000003708","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th International Conference on Complexity, Future Information Systems and Risk","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2362975861","https://openalex.org/W2103432623","https://openalex.org/W2290243676","https://openalex.org/W1592682627","https://openalex.org/W2385361142","https://openalex.org/W4295762832","https://openalex.org/W2366714142","https://openalex.org/W2277362400","https://openalex.org/W2023784850","https://openalex.org/W1533413800"],"abstract_inverted_index":{"Role-based":[0],"similarity":[1,28,38,72,93,104],"search,":[2],"predicated":[3],"on":[4,177],"the":[5,25,33,79,100,112,131,152,158],"topological":[6],"structure":[7],"of":[8,37,41,58,76,114,124,133,160,191],"graphs,":[9],"is":[10],"a":[11,62,89],"highly":[12],"effective":[13],"and":[14,121,135,146,169,172,183,194],"widely":[15],"applicable":[16],"technique":[17,106],"for":[18],"various":[19,140],"real-world":[20],"information":[21,73,110],"extraction":[22,167],"applications.":[23],"Although":[24],"prominent":[26],"rolebased":[27],"algorithm,":[29,95,155],"RoleSim,":[30],"successfully":[31],"provides":[32],"automorphic":[34,52,119],"(role)":[35],"equivalence":[36,53,60,120,123],"between":[39,74],"pairs":[40,75],"nodes,":[42,116],"it":[43],"does":[44],"not":[45],"effectively":[46],"differentiate":[47],"nodes":[48,77],"that":[49,181],"exhibit":[50],"exact":[51],"but":[54],"differ":[55],"in":[56,189],"terms":[57,190],"structural":[59,122],"within":[61],"given":[63],"graph.":[64],"This":[65],"limitation":[66],"arises":[67],"from":[68,111],"disregarding":[69],"most":[70],"adjacency":[71],"during":[78],"RoleSim":[80],"computation.":[81],"To":[82],"address":[83],"this":[84],"research":[85],"gap,":[86],"we":[87,128,150],"propose":[88],"novel":[90],"single-source":[91],"role":[92,125],"search":[94],"named":[96],"FaRS,":[97],"which":[98,156],"employs":[99],"top":[101],"\u0393":[102],"maximum":[103],"matching":[105],"to":[107,139],"capture":[108],"more":[109],"classes":[113],"neighboring":[115],"ensuring":[117],"both":[118,192],"similarity.":[126],"Furthermore,":[127],"establi":[129],"sh":[130],"convergence":[132],"FaRS":[134,154,161,182,185],"demonstrate":[136,180],"its":[137],"adherence":[138],"axioms,":[141],"including":[142],"uniqueness,":[143],"symmetry,":[144],"boundedness,":[145],"triangular":[147],"inequality.":[148],"Additionally,":[149],"introduce":[151],"Opt":[153,184],"optimizes":[157],"computation":[159],"through":[162],"two":[163],"acceleration":[164],"components:":[165],"path":[166],"tracking":[168],"precomputation":[170],"(P-speedup":[171],"Out-speedup":[173],"approach).":[174],"Experimental":[175],"results":[176],"real":[178],"datasets":[179],"outperform":[186],"baseline":[187],"algorithms":[188],"accuracy":[193],"efficiency.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}