{"id":"https://openalex.org/W4380433197","doi":"https://doi.org/10.1145/3588725","title":"An Efficient Algorithm for Distance-based Structural Graph Clustering","display_name":"An Efficient Algorithm for Distance-based Structural Graph Clustering","publication_year":2023,"publication_date":"2023-05-26","ids":{"openalex":"https://openalex.org/W4380433197","doi":"https://doi.org/10.1145/3588725"},"language":"en","primary_location":{"id":"doi:10.1145/3588725","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3588725","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-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/A5100674716","display_name":"Kaixin Liu","orcid":"https://orcid.org/0000-0003-4939-0313"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Kaixin Liu","raw_affiliation_strings":["Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100736050","display_name":"Sibo Wang","orcid":"https://orcid.org/0000-0003-1892-6971"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Sibo Wang","raw_affiliation_strings":["The Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100419741","display_name":"Yong Zhang","orcid":"https://orcid.org/0000-0001-8803-2055"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yong Zhang","raw_affiliation_strings":["Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058043497","display_name":"Chunxiao Xing","orcid":"https://orcid.org/0000-0001-9390-3097"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chunxiao Xing","raw_affiliation_strings":["Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100674716"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":1.9966,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85327391,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"1","issue":"1","first_page":"1","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9962000250816345,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9962000250816345,"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/cluster-analysis","display_name":"Cluster analysis","score":0.7884511947631836},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6149661540985107},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5561825633049011},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5302438735961914},{"id":"https://openalex.org/keywords/closeness","display_name":"Closeness","score":0.5272102355957031},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.513652503490448},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5128024220466614},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47166359424591064},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4467695355415344},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4216309189796448},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.4186815917491913},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3923129737377167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3810843825340271},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34298574924468994},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21298444271087646},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.08889323472976685},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08646667003631592}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7884511947631836},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6149661540985107},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5561825633049011},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5302438735961914},{"id":"https://openalex.org/C2779545769","wikidata":"https://www.wikidata.org/wiki/Q5135364","display_name":"Closeness","level":2,"score":0.5272102355957031},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.513652503490448},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5128024220466614},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47166359424591064},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4467695355415344},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4216309189796448},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.4186815917491913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3923129737377167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3810843825340271},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34298574924468994},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21298444271087646},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.08889323472976685},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08646667003631592},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3588725","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3588725","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5199999809265137}],"awards":[{"id":"https://openalex.org/G210525227","display_name":null,"funder_award_id":"No. U1936205","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8014875156","display_name":null,"funder_award_id":"2020AAA0109603","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1501825524","https://openalex.org/W1967006938","https://openalex.org/W1971421925","https://openalex.org/W1979819093","https://openalex.org/W1994727615","https://openalex.org/W1997871231","https://openalex.org/W2022322548","https://openalex.org/W2048779798","https://openalex.org/W2090914728","https://openalex.org/W2102717275","https://openalex.org/W2142140138","https://openalex.org/W2163855617","https://openalex.org/W2243560673","https://openalex.org/W2436321460","https://openalex.org/W2469279958","https://openalex.org/W2615250859","https://openalex.org/W2885972824","https://openalex.org/W2941367447","https://openalex.org/W3103317839","https://openalex.org/W3114289308","https://openalex.org/W3172331187","https://openalex.org/W3173235128","https://openalex.org/W4232226726","https://openalex.org/W4235169531","https://openalex.org/W6673227071","https://openalex.org/W6727233892"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1589415932","https://openalex.org/W4298178173"],"abstract_inverted_index":{"Structural":[0],"graph":[1,7,104],"clustering":[2,8,91,105,152,172],"(SCAN)":[3],"is":[4,15,58,125,197],"a":[5,12,108,135,223],"classic":[6],"algorithm.":[9],"In":[10],"SCAN,":[11],"key":[13],"step":[14],"to":[16,24,88,155,198,204,229,245,248,273],"compute":[17],"the":[18,25,41,50,70,79,101,118,128,145,156,162,168,188,207,212,217,232,239,260,275,288],"structural":[19,51,103,119,276],"similarity":[20,52,120,218,234,277],"between":[21,53,121,219,262],"vertices":[22,33,55,84,114,221,280],"according":[23],"overlap":[26],"ratio":[27,129],"of":[28,82,130,137,159,170,195,209,226,241,279,292],"one-hop":[29,64],"neighborhoods.":[30],"Given":[31,107,211],"two":[32,83,113,220],"u":[34,44,115,122],"and":[35,45,61,85,99,112,116,123,290],"v,":[36,117],"existing":[37],"studies":[38],"only":[39,63],"consider":[40],"case":[42],"when":[43,258],"v":[46,124],"are":[47],"neighbors.":[48],"However,":[49,161,228],"non-neighboring":[54],"in":[56,167],"SCAN":[57,149,190],"always":[59],"zero,":[60],"using":[62],"neighbors":[65,133],"on":[66,72,284],"weighted":[67],"graphs":[68],"discards":[69],"weights":[71],"each":[73],"edge.":[74],"Both":[75],"may":[76,86],"not":[77],"reflect":[78],"true":[80],"closeness":[81],"fail":[87],"return":[89],"high-quality":[90],"results.":[92,173],"To":[93,174,265],"tackle":[94,175,266],"this":[95,176,267],"issue,":[96,178,268],"we":[97,179,214,269],"define":[98],"study":[100],"distance-based":[102,148,189],"problem.":[106,191],"distance":[109,136],"threshold":[110],"d":[111],"defined":[126,147],"as":[127,249,251],"their":[131],"respective":[132],"within":[134],"no":[138],"more":[139],"than":[140],"d.":[141],"We":[142],"show":[143],"that":[144,231],"newly":[146],"achieves":[150],"better":[151],"results":[153],"compared":[154],"vanilla":[157],"version":[158],"SCAN.":[160],"new":[163],"definition":[164],"brings":[165,254],"challenges":[166],"computation":[169,208],"final":[171],"efficiency":[177,291],"propose":[180],"DistanceSCAN,":[181],"an":[182,236],"efficient":[183],"approximate":[184],"algorithm":[185],"for":[186],"solving":[187],"The":[192],"main":[193],"idea":[194],"DistanceSCAN":[196],"use":[199],"all-distances":[200],"bottom-k":[201],"sketches":[202],"(ADS)":[203],"speed":[205],"up":[206],"similarities.":[210],"ADS,":[213],"can":[215],"derive":[216],"with":[222],"bounded":[224],"cost":[225],"O(k).":[227],"ensure":[230],"estimated":[233],"has":[235],"approximation":[237],"guarantee,":[238],"value":[240],"k":[242],"still":[243],"needs":[244],"be":[246],"set":[247],"large":[250],"thousands.":[252],"This":[253],"high":[255],"computational":[256],"costs":[257],"computing":[259],"similarities":[261],"neighboring":[263],"vertices.":[264],"further":[270],"construct":[271],"histograms":[272],"prune":[274],"computations":[278],"pairs.":[281],"Extensive":[282],"experiments":[283],"real":[285],"datasets":[286],"validate":[287],"effectiveness":[289],"DistanceSCAN.":[293]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":7}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}