{"id":"https://openalex.org/W7109065091","doi":"https://doi.org/10.1145/3769784","title":"Effective Clustering for Large Multi-Relational Graphs","display_name":"Effective Clustering for Large Multi-Relational Graphs","publication_year":2025,"publication_date":"2025-12-04","ids":{"openalex":"https://openalex.org/W7109065091","doi":"https://doi.org/10.1145/3769784"},"language":"en","primary_location":{"id":"doi:10.1145/3769784","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3769784","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":null,"display_name":"Xiaoyang Lin","orcid":"https://orcid.org/0009-0006-2970-5161"},"institutions":[{"id":"https://openalex.org/I141568987","display_name":"Hong Kong Baptist University","ror":"https://ror.org/0145fw131","country_code":"HK","type":"education","lineage":["https://openalex.org/I141568987"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Xiaoyang Lin","raw_affiliation_strings":["Hong Kong Baptist University, Hong Kong, China"],"raw_orcid":"https://orcid.org/0009-0006-2970-5161","affiliations":[{"raw_affiliation_string":"Hong Kong Baptist University, Hong Kong, China","institution_ids":["https://openalex.org/I141568987"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Runhao Jiang","orcid":"https://orcid.org/0009-0000-4841-9175"},"institutions":[{"id":"https://openalex.org/I141568987","display_name":"Hong Kong Baptist University","ror":"https://ror.org/0145fw131","country_code":"HK","type":"education","lineage":["https://openalex.org/I141568987"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Runhao Jiang","raw_affiliation_strings":["Hong Kong Baptist University, Hong Kong, China"],"raw_orcid":"https://orcid.org/0009-0000-4841-9175","affiliations":[{"raw_affiliation_string":"Hong Kong Baptist University, Hong Kong, China","institution_ids":["https://openalex.org/I141568987"]}]},{"author_position":"last","author":{"id":null,"display_name":"Renchi Yang","orcid":"https://orcid.org/0000-0002-7284-3096"},"institutions":[{"id":"https://openalex.org/I141568987","display_name":"Hong Kong Baptist University","ror":"https://ror.org/0145fw131","country_code":"HK","type":"education","lineage":["https://openalex.org/I141568987"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Renchi Yang","raw_affiliation_strings":["Hong Kong Baptist University, Hong Kong, China"],"raw_orcid":"https://orcid.org/0000-0002-7284-3096","affiliations":[{"raw_affiliation_string":"Hong Kong Baptist University, Hong Kong, China","institution_ids":["https://openalex.org/I141568987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I141568987"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.72054399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"6","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.6593000292778015,"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.6593000292778015,"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.1143999993801117,"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.11249999701976776,"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/cluster-analysis","display_name":"Cluster analysis","score":0.642300009727478},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6396999955177307},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6330999732017517},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4966999888420105},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3898000121116638},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.37950000166893005},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.3732999861240387},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.34459999203681946}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7225000262260437},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.642300009727478},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6396999955177307},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6330999732017517},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5177000164985657},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4966999888420105},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3898000121116638},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.37950000166893005},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.37400001287460327},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.3732999861240387},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.34459999203681946},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3037000000476837},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2770000100135803},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2736000120639801},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C59404180","wikidata":"https://www.wikidata.org/wiki/Q17013334","display_name":"Feature learning","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2533000111579895}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3769784","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3769784","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":[],"awards":[{"id":"https://openalex.org/G8618575630","display_name":null,"funder_award_id":"62302414","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1975172027","https://openalex.org/W1980431326","https://openalex.org/W2003447360","https://openalex.org/W2015953751","https://openalex.org/W2097645701","https://openalex.org/W2116341502","https://openalex.org/W2121947440","https://openalex.org/W2124536061","https://openalex.org/W2131681506","https://openalex.org/W2132202037","https://openalex.org/W2132914434","https://openalex.org/W2580753685","https://openalex.org/W2962756421","https://openalex.org/W2963969605","https://openalex.org/W2977707586","https://openalex.org/W2997739739","https://openalex.org/W3014537556","https://openalex.org/W3042856524","https://openalex.org/W3165231040","https://openalex.org/W3210242454","https://openalex.org/W3210378911","https://openalex.org/W3211858897","https://openalex.org/W4205485327","https://openalex.org/W4211056025","https://openalex.org/W4226219101","https://openalex.org/W4292263874","https://openalex.org/W4296639080","https://openalex.org/W4302425955","https://openalex.org/W4312238451","https://openalex.org/W4360825594","https://openalex.org/W4382317881","https://openalex.org/W4393156461","https://openalex.org/W4394935158","https://openalex.org/W4401942923","https://openalex.org/W4408803564"],"related_works":[],"abstract_inverted_index":{"Multi-relational":[0],"graphs":[1],"(MRGs)":[2],"are":[3,124],"an":[4,24],"expressive":[5],"data":[6],"structure":[7],"for":[8,148,195],"modeling":[9],"diverse":[10],"interactions/relations":[11],"among":[12],"real":[13,247],"objects":[14],"(i.e.,":[15],"nodes),":[16],"which":[17,50],"pervade":[18],"extensive":[19],"applications":[20],"and":[21,76,89,99,110,172,200,204],"scenarios.":[22],"Given":[23],"MRG":[25],"G":[26],"with":[27,82,85,209],"N":[28,221,223],"nodes,":[29],"partitioning":[30],"the":[31,56,95,118,132,143,151,154,161,214,220],"node":[32,138,162,197],"set":[33],"therein":[34],"into":[35],"K":[36],"disjoint":[37],"clusters":[38],"(referred":[39],"to":[40,80,94,116,135,231],"as":[41],"MRGC)":[42],"is":[43,252],"a":[44,180,190,202],"fundamental":[45],"task":[46],"in":[47,255],"analyzing":[48],"MRGs,":[49,149,248],"has":[51],"garnered":[52],"considerable":[53],"attention.":[54],"However,":[55],"majority":[57],"of":[58,72,87,91,97,157,182,257],"existing":[59],"solutions":[60],"towards":[61],"MRGC":[62,114],"either":[63],"yield":[64],"severely":[65],"compromised":[66],"result":[67],"quality":[68,259],"by":[69,141],"ineffective":[70],"fusion":[71],"heterogeneous":[73],"graph":[74],"structures":[75],"attributes,":[77],"or":[78],"struggle":[79],"cope":[81],"sizable":[83],"MRGs":[84,234],"millions":[86],"nodes":[88],"billions":[90],"edges":[92],"due":[93],"adoption":[96],"sophisticated":[98],"costly":[100],"deep":[101],"learning":[102],"models.":[103],"In":[104,165],"this":[105],"paper,":[106],"we":[107,228],"present":[108],"DEMM":[109,178,230],"DEMM+,":[111],"two":[112],"effective":[113],"approaches":[115],"address":[117],"aforementioned":[119],"limitations.":[120],"Specifically,":[121],"our":[122,175],"algorithms":[123],"built":[125],"on":[126],"novel":[127],"two-stage":[128],"optimization":[129],"objectives,":[130],"where":[131],"former":[133],"seeks":[134],"derive":[136],"high-caliber":[137],"feature":[139,198],"vectors":[140],"optimizing":[142],"multi-relational":[144],"Dirichlet":[145,155],"energy":[146,156],"specialized":[147],"while":[150,264],"latter":[152],"minimizes":[153],"clustering":[158,216,258],"results":[159],"over":[160,174,245],"affinity":[163,225],"graph.":[164],"particular,":[166],"DEMM+":[167,241,251],"achieves":[168],"significantly":[169],"higher":[170],"scalability":[171],"efficiency":[173],"based":[176],"method":[177],"through":[179,235],"suite":[181],"well-thought-out":[183],"optimizations.":[184],"Key":[185],"technical":[186],"contributions":[187],"include":[188],"(i)":[189],"highly":[191],"efficient":[192],"approximation":[193],"solver":[194],"constructing":[196],"vectors,":[199],"(ii)":[201],"judicious":[203],"theoretically-grounded":[205],"problem":[206],"transformation":[207],"together":[208],"carefully-crafted":[210],"techniques":[211],"that":[212,250],"enable":[213],"linear-time":[215],"without":[217],"explicitly":[218],"materializing":[219],"x":[222],"dense":[224],"matrix.":[226],"Further,":[227],"extend":[229],"handle":[232],"attribute-less":[233],"non-trivial":[236],"adaptations.":[237],"Extensive":[238],"experiments,":[239],"comparing":[240],"against":[242,261],"20":[243],"baselines":[244],"11":[246],"exhibit":[249],"consistently":[253],"superior":[254],"terms":[256],"measured":[260],"ground-truth":[262],"labels,":[263],"often":[265],"being":[266],"remarkably":[267],"faster.":[268]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-12-06T00:00:00"}