{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T06:31:57Z","timestamp":1790749917877,"version":"4.1.0"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:p>\n                    Cohesive subgraph mining is a fundamental problem in bipartite graph analysis. In reality, relationships between two types of entities often occur at some specific timestamps, which can be modeled as a temporal bipartite graph. However, the temporal information is widely neglected by previous studies. Moreover, directly extending the existing models may fail to find some critical groups in temporal bipartite graphs, which appear in a unilateral (i.e., one-layer) form. To fill the gap, in this paper, we propose a novel model, called maximal\n                    <jats:italic>\u03bb<\/jats:italic>\n                    -frequency group (MFG). Given a temporal bipartite graph\n                    <jats:italic>\ud835\udca2<\/jats:italic>\n                    =\n                    <jats:italic>(U, V, \u2130<\/jats:italic>\n                    ), a vertex set\n                    <jats:italic>V<\/jats:italic>\n                    <jats:sub>\n                      <jats:italic>S<\/jats:italic>\n                    <\/jats:sub>\n                    \u2286\n                    <jats:italic>V<\/jats:italic>\n                    is an MFG if\n                    <jats:italic>i<\/jats:italic>\n                    ) there are no less than\n                    <jats:italic>\u03bb<\/jats:italic>\n                    timestamps, at each of which\n                    <jats:italic>\n                      V\n                      <jats:sub>S<\/jats:sub>\n                    <\/jats:italic>\n                    can form a (\n                    <jats:italic>\n                      \u03c4\n                      <jats:sub>U<\/jats:sub>\n                      , \u03c4\n                      <jats:sub>V<\/jats:sub>\n                    <\/jats:italic>\n                    )-biclique with some vertices in\n                    <jats:italic>U<\/jats:italic>\n                    at the corresponding snapshot, and\n                    <jats:italic>ii<\/jats:italic>\n                    ) it is maximal. To solve the problem, a filter-and-verification (FilterV) method is proposed based on the Bron-Kerbosch framework, incorporating novel filtering techniques to reduce the search space and array-based strategy to accelerate the frequency and maximality verification. Nevertheless, the cost of frequency verification in each valid candidate set computation and maximality check could limit the scalability of FilterV to larger graphs. Therefore, we further develop a novel verification-free (VFree) approach by leveraging the advanced dynamic counting structure proposed. Theoretically, we prove that VFree can reduce the cost of each valid candidate set computation in FilterV by a factor of\n                    <jats:italic>O<\/jats:italic>\n                    (|\n                    <jats:italic>V<\/jats:italic>\n                    |). Furthermore, VFree can avoid the explicit maximality verification because of the developed search paradigm. Finally, comprehensive experiments on 15 real-world graphs are conducted to demonstrate the efficiency and effectiveness of the proposed techniques and model.\n                  <\/jats:p>","DOI":"10.14778\/3681954.3681997","type":"journal-article","created":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T12:23:36Z","timestamp":1725020616000},"page":"3243-3255","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs"],"prefix":"10.14778","volume":"17","author":[{"given":"Yanping","family":"Wu","sequence":"first","affiliation":[{"name":"University of Technology Sydney"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renjie","family":"Sun","sequence":"additional","affiliation":[{"name":"East China Normal University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[{"name":"The University of New South Wales"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[{"name":"The University of New South Wales"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Technology Sydney"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[{"name":"University of Technology Sydney"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"Shanghai Jiaotong University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,8,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Goldberger A Amaral L Glass L Hausdorff J Ivanov PC Mark R Mietus JE Moody GB Peng CK and Stanley HE. 2000. PhysioBank PhysioToolkit and PhysioNet: Components of a new research resource for complex physiologic signals. Circulation 101 (23) (2000) e215--e220.","DOI":"10.1161\/01.CIR.101.23.e215"},{"key":"e_1_2_1_2_1","unstructured":"Johnson A Pollard T and Mark R. 2016. MIMIC-III Clinical Database (version 1.4). PhysioNet (2016)."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Aman Abidi Rui Zhou Lu Chen and Chengfei Liu. 2020. Pivot-based Maximal Biclique Enumeration. In IJCAI. 3558--3564.","DOI":"10.24963\/ijcai.2020\/492"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.09.004"},{"key":"e_1_2_1_5_1","volume-title":"Gianmarco De Francisci Morales, and Aristides Gionis.","author":"Aslay Cigdem","year":"2018","unstructured":"Cigdem Aslay, Muhammad Anis Uddin Nasir, Gianmarco De Francisci Morales, and Aristides Gionis. 2018. Mining frequent patterns in evolving graphs. In CIKM. 923--932."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-021-95802-0"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3570690.3570700"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Alex Beutel Wanhong Xu Venkatesan Guruswami Christopher Palow and Christos Faloutsos. 2013. Copycatch: stopping group attacks by spotting lockstep behavior in social networks. In WWW. 119--130.","DOI":"10.1145\/2488388.2488400"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3636218.3636223"},{"key":"e_1_2_1_10_1","first-page":"1791","article-title":"Maximum Signed &theta;-Clique Identification in Large Signed Graphs","volume":"35","author":"Chen Chen","year":"2023","unstructured":"Chen Chen, Yanping Wu, Renjie Sun, and Xiaoyang Wang. 2023. Maximum Signed &theta;-Clique Identification in Large Signed Graphs. IEEE Trans. Knowl. Data Eng. 35, 2 (2023), 1791--1802.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3529337.3529341"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3467861.3467873"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3358701.3358704"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Daniel J DiTursi Gaurav Ghosh and Petko Bogdanov. 2017. Local community detection in dynamic networks. In ICDM. 847--852.","DOI":"10.1109\/ICDM.2017.103"},{"key":"e_1_2_1_15_1","volume-title":"Feng Mengling, Ghassemi Mohammad, Moody Benjamin, Szolovits Peter, Anthony Celi Leo, and Mark Roger G.","author":"Pollard Johnson Alistair EW","year":"2016","unstructured":"Johnson Alistair EW, Pollard Tom J, Shen Lu, Lehman Li wei H, Feng Mengling, Ghassemi Mohammad, Moody Benjamin, Szolovits Peter, Anthony Celi Leo, and Mark Roger G. 2016. MIMIC-III, a freely accessible critical care database. Scientific data 3, 1 (2016), 1--9."},{"key":"e_1_2_1_16_1","volume-title":"Enumeration aspects of maximal cliques and bicliques. Discrete applied mathematics 157, 7","author":"G\u00e9ly Alain","year":"2009","unstructured":"Alain G\u00e9ly, Lhouari Nourine, and Bachir Sadi. 2009. Enumeration aspects of maximal cliques and bicliques. Discrete applied mathematics 157, 7 (2009), 1447--1459."},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Farnoosh Hashemi Ali Behrouz and Laks VS Lakshmanan. 2022. FirmCore Decomposition of Multilayer Networks. In WWW. 1589--1600.","DOI":"10.1145\/3485447.3512205"},{"key":"e_1_2_1_18_1","volume-title":"Alex Beutel, Neil Shah, Kijung Shin, and Christos Faloutsos.","author":"Hooi Bryan","year":"2016","unstructured":"Bryan Hooi, Hyun Ah Song, Alex Beutel, Neil Shah, Kijung Shin, and Christos Faloutsos. 2016. Fraudar: Bounding graph fraud in the face of camouflage. In SIGKDD. 895--904."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888912000331"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3547305.3547318"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0233296"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Mo Li Zhiran Xie and Linlin Ding. 2023. Persistent Community Search Over Temporal Bipartite Graphs. In ADMA. 324--339.","DOI":"10.1007\/978-3-031-46677-9_23"},{"key":"e_1_2_1_23_1","volume-title":"Jeffrey Xu Yu, and Qiangqiang Dai","author":"Li Rong-Hua","year":"2018","unstructured":"Rong-Hua Li, Jiao Su, Lu Qin, Jeffrey Xu Yu, and Qiangqiang Dai. 2018. Persistent community search in temporal networks. In ICDE. 797--808."},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Boge Liu Long Yuan Xuemin Lin Lu Qin Wenjie Zhang and Jingren Zhou. 2019. Efficient (&alpha; \u03b2)-core Computation: an Index-based Approach. In WWW. 1130--1141.","DOI":"10.1145\/3308558.3313522"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823728_42"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Muyi Liu and Pan Li. 2022. SATMargin: Practical Maximal Frequent Subgraph Mining via Margin Space Sampling. In WWW. 1495--1505.","DOI":"10.1145\/3485447.3512196"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Xuanming Liu Tingjian Ge and Yinghui Wu. 2019. Finding densest lasting subgraphs in dynamic graphs: A stochastic approach. In ICDE. 782--793.","DOI":"10.1109\/ICDE.2019.00075"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3484224.3484230"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397234"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Shuai Ma Renjun Hu Luoshu Wang Xuelian Lin and Jinpeng Huai. 2017. Fast computation of dense temporal subgraphs. In ICDE. 361--372.","DOI":"10.1109\/ICDE.2017.95"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2020.2974849"},{"key":"e_1_2_1_32_1","unstructured":"Hongchao Qin Rong-Hua Li Guoren Wang Lu Qin Yurong Cheng and Ye Yuan. 2019. Mining periodic cliques in temporal networks. In ICDE. 1130--1141."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565845"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2458-14-1285"},{"key":"e_1_2_1_35_1","unstructured":"Renjie Sun Chen Chen Xiaoyang Wang Wenjie Zhang Ying Zhang and Xuemin Lin. 2023. Efficient maximum signed biclique identification. In ICDE. 1313--1325."},{"key":"e_1_2_1_36_1","unstructured":"Renjie Sun Yanping Wu Chen Chen Xiaoyang Wang Wenjie Zhang and Xuemin Lin. 2022. Maximal balanced signed biclique enumeration in signed bipartite graphs. In ICDE. 1887--1899."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3296721"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551834"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-16780-x"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00658-5"},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Yiqi Wang Long Yuan Zi Chen Wenjie Zhang Xuemin Lin and Qing Liu. 2023. Towards efficient shortest path counting on billion-scale graphs. In ICDE. 2579--2592.","DOI":"10.1109\/ICDE55515.2023.00198"},{"key":"e_1_2_1_42_1","volume-title":"Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs. arXiv preprint arXiv:2407.03954","author":"Wu Yanping","year":"2024","unstructured":"Yanping Wu, Renjie Sun, Xiaoyang Wang, Dong Wen, Ying Zhang, Lu Qin, and Xuemin Lin. 2024. Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs. arXiv preprint arXiv:2407.03954 (2024)."},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Guizhen Yang. 2004. The complexity of mining maximal frequent itemsets and maximal frequent patterns. In SIGKDD. 344--353.","DOI":"10.1145\/1014052.1014091"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.029"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447702"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Yi Yang Da Yan Huanhuan Wu James Cheng Shuigeng Zhou and John CS Lui. 2016. Diversified temporal subgraph pattern mining. In SIGKDD. 1965--1974.","DOI":"10.1145\/2939672.2939848"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551854"},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Qianzhen Zhang Deke Guo Xiang Zhao Long Yuan and Lailong Luo. 2023. Discovering Frequency Bursting Patterns in Temporal Graphs. In ICDE. 599--611.","DOI":"10.1109\/ICDE55515.2023.00052"},{"key":"e_1_2_1_49_1","volume-title":"On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics 15, 1","author":"Zhang Yun","year":"2014","unstructured":"Yun Zhang, Charles A Phillips, Gary L Rogers, Erich J Baker, Elissa J Chesler, and Michael A Langston. 2014. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC bioinformatics 15, 1 (2014), 1--18."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNB.2019.2922214"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489502"},{"key":"e_1_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Rong Zhu Zhaonian Zou and Jianzhong Li. 2018. Diversified coherent core search on multi-layer graphs. In ICDE. 701--712.","DOI":"10.1109\/ICDE.2018.00069"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3681954.3681997","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T10:15:58Z","timestamp":1732702558000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3681954.3681997"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":52,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["10.14778\/3681954.3681997"],"URL":"https:\/\/doi.org\/10.14778\/3681954.3681997","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"2024-08-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}