{"id":"https://openalex.org/W4393212306","doi":"https://doi.org/10.1145/3639278","title":"Efficient High-Quality Clustering for Large Bipartite Graphs","display_name":"Efficient High-Quality Clustering for Large Bipartite Graphs","publication_year":2024,"publication_date":"2024-03-12","ids":{"openalex":"https://openalex.org/W4393212306","doi":"https://doi.org/10.1145/3639278"},"language":"en","primary_location":{"id":"doi:10.1145/3639278","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639278","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639278","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,"listed_in":["cwts-core","norway-1"],"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":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3639278","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040420455","display_name":"Renchi Yang","orcid":"https://orcid.org/0000-0002-7284-3096","observed_orcids":["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, Hong Kong"],"raw_orcid":"https://orcid.org/0000-0002-7284-3096","affiliations":[{"raw_affiliation_string":"Hong Kong Baptist University, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I141568987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007796732","display_name":"J. Y. Shi","orcid":"https://orcid.org/0000-0002-0465-1551","observed_orcids":["https://orcid.org/0000-0002-0465-1551","https://orcid.org/0009-0000-6832-523X"]},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Jieming Shi","raw_affiliation_strings":["Hong Kong Polytechnic University, Hong Kong, Hong Kong"],"raw_orcid":"https://orcid.org/0000-0002-0465-1551","affiliations":[{"raw_affiliation_string":"Hong Kong Polytechnic University, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3866,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.89567664,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"2","issue":"1","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.6029999852180481,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.6029999852180481,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.2280000001192093,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.08699999749660492,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/k-clustering","display_name":"k-clustering","score":0.7749999761581421},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"low-rank approximation","score":0.9860000014305115},{"id":"https://openalex.org/keywords/large-graphs","display_name":"large-scale graphs","score":0.7120000123977661},{"id":"https://openalex.org/keywords/two-stage-optimization","display_name":"two-stage optimization","score":0.6990000009536743},{"id":"https://openalex.org/keywords/spectral-norm","display_name":"spectral norm","score":0.6340000033378601},{"id":"https://openalex.org/keywords/frobenius-norm","display_name":"Frobenius norm","score":0.9879999756813049},{"id":"https://openalex.org/keywords/graph-partitioning","display_name":"graph partitioning","score":0.6320000290870667},{"id":"https://openalex.org/keywords/scalability","display_name":"scalability","score":0.32899999618530273}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8369553089141846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.619206428527832},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5989975333213806},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5746866464614868},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5571987628936768},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5224189758300781},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47131258249282837},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38960301876068115},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.36239808797836304},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3366708755493164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30220264196395874},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2504425644874573},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0910453200340271}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3639278","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639278","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639278","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,"listed_in":["cwts-core","norway-1"],"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":{"id":"doi:10.1145/3639278","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639278","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639278","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,"listed_in":["cwts-core","norway-1"],"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"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3669285908","display_name":null,"funder_award_id":"62302414, 62202404","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"},{"id":"https://openalex.org/G3672326281","display_name":null,"funder_award_id":"22202623, 25201221","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4393212306.pdf","grobid_xml":"https://content.openalex.org/works/W4393212306.grobid-xml"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W201974436","https://openalex.org/W595549847","https://openalex.org/W1483064154","https://openalex.org/W1493217831","https://openalex.org/W1647225459","https://openalex.org/W1932742904","https://openalex.org/W1971421925","https://openalex.org/W1975172027","https://openalex.org/W1977556410","https://openalex.org/W1987643017","https://openalex.org/W1998894210","https://openalex.org/W2008006577","https://openalex.org/W2013029404","https://openalex.org/W2032273054","https://openalex.org/W2046253692","https://openalex.org/W2054610764","https://openalex.org/W2076248831","https://openalex.org/W2082257952","https://openalex.org/W2089741025","https://openalex.org/W2095897464","https://openalex.org/W2098509290","https://openalex.org/W2112766038","https://openalex.org/W2114167422","https://openalex.org/W2115167491","https://openalex.org/W2128366083","https://openalex.org/W2133299088","https://openalex.org/W2133576408","https://openalex.org/W2139549981","https://openalex.org/W2156457972","https://openalex.org/W2160249427","https://openalex.org/W2164928285","https://openalex.org/W2231488453","https://openalex.org/W2266294848","https://openalex.org/W2583803680","https://openalex.org/W2590430884","https://openalex.org/W2614950151","https://openalex.org/W2743489687","https://openalex.org/W2768176142","https://openalex.org/W2798115135","https://openalex.org/W2963709987","https://openalex.org/W3003992897","https://openalex.org/W3007813770","https://openalex.org/W3039500550","https://openalex.org/W3094504436","https://openalex.org/W3097691372","https://openalex.org/W3100427564","https://openalex.org/W3101543043","https://openalex.org/W3106210303","https://openalex.org/W3126391297","https://openalex.org/W3133655341","https://openalex.org/W4224313061","https://openalex.org/W4232006005","https://openalex.org/W4235169531","https://openalex.org/W4281868159","https://openalex.org/W4388974605","https://openalex.org/W6629329278","https://openalex.org/W6791301209"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2099195351","https://openalex.org/W2999799752","https://openalex.org/W2372768926","https://openalex.org/W2115167491"],"abstract_inverted_index":{"A":[0],"bipartite":[1,46,104,129],"graph":[2,47],"contains":[3],"inter-set":[4],"edges":[5],"between":[6,29,97],"two":[7,116],"disjoint":[8,50],"vertex":[9,42],"sets,":[10],"and":[11,26,31,73,121,135,153,177,188,210],"is":[12,37,55,201,253,267],"widely":[13],"used":[14],"to":[15,38,57,75,81,91,101,169,227,238,255],"model":[16],"real-world":[17,217],"data,":[18],"such":[19],"as":[20],"user-item":[21],"purchase":[22],"records,":[23],"author-article":[24],"publications,":[25],"biological":[27],"interactions":[28],"drugs":[30],"proteins.":[32],"k-Bipartite":[33],"Graph":[34],"Clustering":[35],"(k-BGC)":[36],"partition":[39],"the":[40,58,145,166,195,204,244,259],"target":[41],"set":[43],"in":[44,62,203,230],"a":[45,77,138,173,178],"into":[48],"k":[49],"clusters.":[51],"The":[52],"clustering":[53,85,261],"quality":[54,89],"important":[56],"utility":[59],"of":[60,94,108,148,160,232,240],"k-BGC":[61,82,118,140,167],"various":[63],"applications":[64],"like":[65],"social":[66],"network":[67],"analysis,":[68],"recommendation":[69],"systems,":[70],"text":[71],"mining,":[72],"bioinformatics,":[74],"name":[76],"few.":[78],"Existing":[79],"approaches":[80],"either":[83,194],"output":[84],"results":[86],"with":[87,106,172,248,258],"compromised":[88],"due":[90],"inadequate":[92],"exploitation":[93],"high-order":[95,149],"information":[96],"vertices,":[98],"or":[99,198],"fail":[100],"handle":[102],"sizable":[103],"graphs":[105],"billions":[107],"edges.":[109],"Motivated":[110],"by":[111,269],"this,":[112],"this":[113],"paper":[114],"presents":[115],"efficient":[117,155,180],"solutions,":[119,222],"HOPE":[120,131,209],"HOPE+,":[122,224],"which":[123,266],"achieve":[124],"state-of-the-art":[125],"performance":[126,168],"on":[127,144,215],"large-scale":[128],"graphs.":[130],"obtains":[132],"high":[133],"scalability":[134],"effectiveness":[136],"through":[137],"new":[139],"problem":[141,175],"formulation":[142],"based":[143],"novel":[146],"notion":[147],"perspective":[150],"(HOP)":[151],"vectors":[152],"an":[154],"technique":[156],"for":[157,273],"low-rank":[158],"approximation":[159],"HOP":[161],"vectors.":[162],"HOPE+":[163,186,189,211,252],"further":[164],"elevates":[165],"another":[170],"level":[171],"judicious":[174],"transformation":[176],"highly":[179],"two-stage":[181],"optimization":[182],"framework.":[183],"Two":[184],"variants,":[185],"(FNEM)":[187],"(SNEM)":[190],"are":[191,225],"designed":[192],"when":[193],"Frobenius":[196],"norm":[197,200],"spectral":[199],"applied":[202],"transformation.":[205],"Extensive":[206],"experiments,":[207],"comparing":[208],"against":[212],"13":[213],"competitors":[214],"10":[216],"datasets,":[218],"exhibit":[219],"that":[220],"our":[221],"especially":[223],"superior":[226],"existing":[228,271],"methods":[229],"terms":[231],"result":[233],"quality,":[234],"while":[235],"being":[236],"up":[237],"orders":[239],"magnitude":[241],"faster.":[242],"On":[243],"largest":[245],"dataset":[246],"MAG":[247],"1.1":[249],"billion":[250],"edges,":[251],"able":[254],"produce":[256],"clusters":[257],"highest":[260],"accuracy":[262],"within":[263],"31":[264],"minutes,":[265],"unmatched":[268],"any":[270],"solution":[272],"k-BGC.":[274]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":3}],"updated_date":"2026-09-25T08:18:29.962427","created_date":"2025-10-10T00:00:00"}