{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:04:47Z","timestamp":1780675487946,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":67,"publisher":"ACM","funder":[{"name":"National Natural Science Foundation of China","award":["62402399"],"award-info":[{"award-number":["62402399"]}]},{"name":"Natural Science Foundation of Chongqing","award":["CSTB2025NSCQ-GPX1268"],"award-info":[{"award-number":["CSTB2025NSCQ-GPX1268"]}]},{"name":"Science and Technology Research Program of Chongqing Municipal Education Commission","award":["KJQN202500647"],"award-info":[{"award-number":["KJQN202500647"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,4,13]]},"DOI":"10.1145\/3774904.3792116","type":"proceedings-article","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T21:54:34Z","timestamp":1775771674000},"page":"559-570","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable and Provable Biclique-Preserving Clustering: The Power of Counting-based Approaches"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2194-8146","authenticated-orcid":false,"given":"Longlong","family":"Lin","sequence":"first","affiliation":[{"name":"Southwest University, Chongqing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5053-5201","authenticated-orcid":false,"given":"Zeli","family":"Wang","sequence":"additional","affiliation":[{"name":"Chongqing University of Posts and Telecommunications, Chongqing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8658-6599","authenticated-orcid":false,"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7822-4512","authenticated-orcid":false,"given":"Xiaohai","family":"Dai","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0178-3839","authenticated-orcid":false,"given":"Li","family":"Ni","sequence":"additional","affiliation":[{"name":"Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4217-7886","authenticated-orcid":false,"given":"Jin","family":"Zhao","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,4,12]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1807","article-title":"Co-clustering Document-term Matrices by Direct Maximization of Graph Modularity","author":"Ailem Melissa","year":"2015","unstructured":"Melissa Ailem, Fran\u00e7ois Role, and Mohamed Nadif. 2015. Co-clustering Document-term Matrices by Direct Maximization of Graph Modularity. In CIKM. 1807-1810.","journal-title":"CIKM."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx001"},{"key":"e_1_3_2_1_3_1","series-title":"Series B","volume-title":"isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory","author":"Alon Noga","year":"1985","unstructured":"Noga Alon and Vitali D Milman. 1985. \u03bb, isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory, Series B, Vol. 38, 1 (1985)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/41\/22\/224001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.066102"},{"key":"e_1_3_2_1_6_1","first-page":"163","volume-title":"Science","volume":"353","author":"Benson Austin R","year":"2016","unstructured":"Austin R Benson, David F Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. Science, Vol. 353, 6295 (2016), 163-166."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Inderjit S. Dhillon. [n.d.]. Co-clustering documents and words using bipartite spectral graph partitioning. In KDD. 269-274.","DOI":"10.1145\/502512.502550"},{"key":"e_1_3_2_1_8_1","volume-title":"Modha","author":"Dhillon Inderjit S.","year":"2003","unstructured":"Inderjit S. Dhillon, Subramanyam Mallela, and Dharmendra S. Modha. 2003. Information-theoretic co-clustering. In kdd, Lise Getoor, Ted E. Senator, Pedro M. Domingos, and Christos Faloutsos (Eds.). 89-98."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Danhao Ding Hui Li Zhipeng Huang and Nikos Mamoulis. 2017. Efficient Fault-Tolerant Group Recommendation Using alpha-beta-core. In CIKM.","DOI":"10.1145\/3132847.3133130"},{"key":"e_1_3_2_1_10_1","first-page":"426","article-title":"Higher-order Clustering and Pooling for Graph Neural Networks","author":"Duval Alexandre","year":"2022","unstructured":"Alexandre Duval and Fragkiskos D. Malliaros. 2022. Higher-order Clustering and Pooling for Graph Neural Networks. In CIKM. 426-435.","journal-title":"CIKM."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90121-X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_3_2_1_13_1","volume-title":"Algebraic connectivity of graphs. Czechoslovak mathematical journal","author":"Fiedler Miroslav","year":"1973","unstructured":"Miroslav Fiedler. 1973. Algebraic connectivity of graphs. Czechoslovak mathematical journal, Vol. 23, 2 (1973), 298-305."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"},{"key":"e_1_3_2_1_15_1","first-page":"189","article-title":"Link-based Classification","author":"Getoor Lise","year":"2005","unstructured":"Lise Getoor. 2005. Link-based Classification. Springer, 189-207.","journal-title":"Springer"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"David F. Gleich and C. Seshadhri. 2012. Vertex neighborhoods low conductance cuts and good seeds for local community methods. In KDD.","DOI":"10.1145\/2339530.2339628"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123915"},{"key":"e_1_3_2_1_19_1","first-page":"1033","article-title":"Scalable and Interpretable Product Recommendations via Overlapping Co-Clustering","author":"Heckel Reinhard","year":"2017","unstructured":"Reinhard Heckel, Michail Vlachos, Thomas P. Parnell, and Celestine D\u00fcnner. 2017. Scalable and Interpretable Product Recommendations via Overlapping Co-Clustering. In ICDE. 1033-1044.","journal-title":"ICDE."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Ling Huang Hong-Yang Chao and Guangqiang Xie. 2020. MuMod: A Micro-Unit Connection Approach for Hybrid-Order Community Detection. In AAAI.","DOI":"10.1609\/aaai.v34i01.5340"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018667"},{"key":"e_1_3_2_1_22_1","volume-title":"Spectral biclustering of microarray data: coclustering genes and conditions. Genome research","author":"Kluger Yuval","year":"2003","unstructured":"Yuval Kluger, Ronen Basri, Joseph T Chang, and Mark Gerstein. 2003. Spectral biclustering of microarray data: coclustering genes and conditions. Genome research, Vol. 13, 4 (2003), 703-716."},{"key":"e_1_3_2_1_23_1","first-page":"1140","article-title":"Co-clustering for Binary and Categorical Data with Maximum Modularity","author":"Labiod Lazhar","year":"2011","unstructured":"Lazhar Labiod and Mohamed Nadif. 2011. Co-clustering for Binary and Categorical Data with Maximum Modularity. In ICDM. 1140-1145.","journal-title":"ICDM."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.04.006"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2025.3588028"},{"key":"e_1_3_2_1_26_1","first-page":"1793","article-title":"PSMC","author":"Lin Longlong","year":"2024","unstructured":"Longlong Lin, Tao Jia, Zeli Wang, Jin Zhao, and Rong-Hua Li. 2024. PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering. In KDD. 1793-1803.","journal-title":"In KDD."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2025.3630626"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25568"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2025.3579811"},{"key":"e_1_3_2_1_30_1","first-page":"1130","article-title":"Efficient (a,(\u03b2))-core Computation: an Index-based Approach","author":"Liu Boge","year":"2019","unstructured":"Boge Liu, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang, and Jingren Zhou. 2019. Efficient (a,(\u03b2))-core Computation: an Index-based Approach. In WWW. ACM, 1130-1141.","journal-title":"WWW. ACM"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"R. Milo S. Shen-Orr S. Itzkovitz N. Kashtan D. Chklovskii and U. Alon. 2002. Network motifs: simple building blocks of complex networks. Science (2002).","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_1_32_1","volume-title":"Fast algorihtm for detecting community structure in networks. Physical Review E","author":"Newman E.","year":"2004","unstructured":"Mark. E. Newman. 2004. Fast algorihtm for detecting community structure in networks. Physical Review E (2004), 66-133."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2011.07.001"},{"key":"e_1_3_2_1_34_1","first-page":"3191","article-title":"Accelerating biclique counting on GPU","author":"Qiu Linshan","year":"2024","unstructured":"Linshan Qiu, Zhonggen Li, Xiangyu Ke, Lu Chen, and Yunjun Gao. 2024. Accelerating biclique counting on GPU. In ICDE. 3191-3203.","journal-title":"ICDE."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v088.i07"},{"key":"e_1_3_2_1_36_1","first-page":"2150","article-title":"Butterfly Counting in Bipartite Networks","author":"Sanei-Mehri Seyed-Vahid","year":"2018","unstructured":"Seyed-Vahid Sanei-Mehri, Ahmet Erdem Sariy\u00fcce, and Srikanta Tirthapura. 2018. Butterfly Counting in Bipartite Networks. In KDD. 2150-2159.","journal-title":"KDD."},{"key":"e_1_3_2_1_37_1","first-page":"504","article-title":"Peeling Bipartite Networks for Dense Subgraph Discovery","author":"Sariy\u00fcce Ahmet Erdem","year":"2018","unstructured":"Ahmet Erdem Sariy\u00fcce and Ali Pinar. 2018. Peeling Bipartite Networks for Dense Subgraph Discovery. In WSDM. 504-512.","journal-title":"WSDM."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401962"},{"key":"e_1_3_2_1_39_1","first-page":"278","article-title":"ComSim: A Bipartite Community Detection Algorithm Using Cycle and Node's Similarity","volume":"689","author":"Tackx Raphael","year":"2017","unstructured":"Raphael Tackx, Fabien Tarissan, and Jean-Loup Guillaume. 2017. ComSim: A Bipartite Community Detection Algorithm Using Cycle and Node's Similarity. In COMPLEX NETWORKS, Vol. 689. 278-289.","journal-title":"COMPLEX NETWORKS"},{"key":"e_1_3_2_1_40_1","volume-title":"Lecture notes on graph partitioning, expanders and spectral methods","author":"Trevisan Luca","year":"2016","unstructured":"Luca Trevisan. 2017. Lecture notes on graph partitioning, expanders and spectral methods. University of California, Berkeley, https:\/\/people. eecs. berkeley. edu\/luca\/books\/expanders-2016.pdf (2017)."},{"key":"e_1_3_2_1_41_1","first-page":"1451","article-title":"Scalable Motif-aware Graph Clustering","author":"Tsourakakis Charalampos E.","year":"2017","unstructured":"Charalampos E. Tsourakakis, Jakub Pachocki, and Michael Mitzenmacher. 2017. Scalable Motif-aware Graph Clustering. In WWW. 1451-1460.","journal-title":"WWW."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148257"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339497"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00658-5"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00746-0"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3538598.3538610"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588714"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835836"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3108974"},{"key":"e_1_3_2_1_50_1","first-page":"414","article-title":"Deep Co-Clustering","author":"Xu Dongkuan","year":"2019","unstructured":"Dongkuan Xu, Wei Cheng, Bo Zong, Jingchao Ni, Dongjin Song, Wenchao Yu, Yuncong Chen, Haifeng Chen, and Xiang Zhang. 2019. Deep Co-Clustering. In SDM. 414-422.","journal-title":"SDM."},{"key":"e_1_3_2_1_51_1","first-page":"2251","article-title":"Personalized Showcases","author":"Yan An","year":"2023","unstructured":"An Yan, Zhankui He, Jiacheng Li, Tianyang Zhang, and Julian John McAuley. 2023. Personalized Showcases: Generating Multi-Modal Explanations for Recommendations. In SIGIR. 2251-2255.","journal-title":"Generating Multi-Modal Explanations for Recommendations. In SIGIR."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00786-0"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489497"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639278"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447702"},{"key":"e_1_3_2_1_56_1","volume-title":"Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach. CoRR","author":"Yang Yichun","year":"2024","unstructured":"Yichun Yang, Rong-Hua Li, Meihao Liao, Longlong Lin, and Guoren Wang. 2024. Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach. CoRR, Vol. abs\/2412.10789 (2024)."},{"key":"e_1_3_2_1_57_1","volume-title":"Revealing the Hidden Language of Complex Networks. Scientific Reports","volume":"4","author":"Yaveroglu O. N.","year":"2014","unstructured":"O. N. Yaveroglu, N. Malod-Dognin, D. Davis, Z. Levnajic, V. Janjic, R. Karapandza, A. Stojmirovic, and N. Przulj. 2014. Revealing the Hidden Language of Complex Networks. Scientific Reports, Vol. 4 (2014)."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588932"},{"key":"e_1_3_2_1_59_1","volume-title":"Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach. arXiv preprint arXiv:2412.16485","author":"Ye Xiaowei","year":"2024","unstructured":"Xiaowei Ye, Rong-Hua Li, Longlong Lin, Shaojie Qiao, and Guoren Wang. 2024. Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach. arXiv preprint arXiv:2412.16485 (2024)."},{"key":"e_1_3_2_1_60_1","first-page":"555","article-title":"Local Higher-Order Graph Clustering","author":"Yin Hao","year":"2017","unstructured":"Hao Yin, Austin R. Benson, Jure Leskovec, and David F. Gleich. 2017. Local Higher-Order Graph Clustering. In KDD. 555-564.","journal-title":"KDD."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-55130-8_42"},{"key":"e_1_3_2_1_62_1","first-page":"655","article-title":"A Local Algorithm for Structure-Preserving Graph Cut","author":"Zhou Dawei","year":"2017","unstructured":"Dawei Zhou, Si Zhang, Mehmet Yigit Yildirim, Scott Alcorn, Hanghang Tong, Hasan Davulcu, and Jingrui He. 2017. A Local Algorithm for Structure-Preserving Graph Cut. In KDD. 655-664.","journal-title":"KDD."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3425637"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3749176"},{"key":"e_1_3_2_1_65_1","article-title":"Analysis of spectral clustering algorithms for community detection: the general bipartite setting","volume":"20","author":"Zhou Zhixin","year":"2019","unstructured":"Zhixin Zhou and Arash A. Amini. 2019. Analysis of spectral clustering algorithms for community detection: the general bipartite setting. J. Mach. Learn. Res., Vol. 20 (2019), 47:1-47:47.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_66_1","article-title":"Optimal Bipartite Network Clustering","volume":"21","author":"Zhou Zhixin","year":"2020","unstructured":"Zhixin Zhou and Arash A. Amini. 2020. Optimal Bipartite Network Clustering. J. Mach. Learn. Res., Vol. 21 (2020), 40:1-40:68.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-011-0021-0"}],"event":{"name":"WWW '26: The ACM Web Conference 2026","location":"Dubai United Arab Emirates","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2026"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774904.3792116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:37:17Z","timestamp":1780673837000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774904.3792116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,12]]},"references-count":67,"alternative-id":["10.1145\/3774904.3792116","10.1145\/3774904"],"URL":"https:\/\/doi.org\/10.1145\/3774904.3792116","relation":{},"subject":[],"published":{"date-parts":[[2026,4,12]]},"assertion":[{"value":"2026-04-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}