{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:44:17Z","timestamp":1787017457804,"version":"build-2736575974"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,2,10]]},"abstract":"<jats:p>\n                    Overlapping Community Search (OCS) identifies nodes that interact with multiple communities based on a specified query. Existing community search approaches fall into two categories: algorithm-based models and Machine Learning-based (ML) models. Despite the long-standing focus on this topic within the database domain, current solutions face two major limitations: 1) Both approaches fail to address personalized user requirements in OCS, consistently returning the same set of nodes for a given query regardless of user differences. 2) Existing ML-based CS models suffer from severe training efficiency issues. In this paper, we formally redefine the problem of OCS. By analyzing the gaps in both types of approaches, we then propose a general solution for OCS named\n                    <jats:bold>&lt;u&gt;S&lt;\/u&gt;<\/jats:bold>\n                    parse\n                    <jats:bold>&lt;u&gt;S&lt;\/u&gt;<\/jats:bold>\n                    ubspace\n                    <jats:bold>&lt;u&gt;F&lt;\/u&gt;<\/jats:bold>\n                    ilter (SSF), which can extend any ML-based CS model to enable personalized search in overlapping structures. To overcome the efficiency issue in the current models, we introduce\n                    <jats:bold>&lt;u&gt;S&lt;\/u&gt;<\/jats:bold>\n                    implified\n                    <jats:bold>&lt;u&gt;M&lt;\/u&gt;<\/jats:bold>\n                    ulti-hop Attention\n                    <jats:bold>&lt;u&gt;N&lt;\/u&gt;<\/jats:bold>\n                    etworks (SMN), a lightweight yet effective community search model with larger receptive fields. To the best of our knowledge, this is the first ML-based study of overlapping community search. Extensive experiments validate the superior performance of SMN within the SSF pipeline, achieving a 13.73% improvement in F1-Score and up to 3 orders of magnitude acceleration in model efficiency compared to state-of-the-art approaches.\n                  <\/jats:p>","DOI":"10.1145\/3709678","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T15:45:06Z","timestamp":1739288706000},"page":"1-26","source":"Crossref","is-referenced-by-count":13,"title":["Deep Overlapping Community Search via Subspace Embedding"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-7595-123X","authenticated-orcid":false,"given":"Qing","family":"Sima","sequence":"first","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2032-7727","authenticated-orcid":false,"given":"Jianke","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3554-3219","authenticated-orcid":false,"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6572-2600","authenticated-orcid":false,"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2674-1638","authenticated-orcid":false,"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-7225","authenticated-orcid":false,"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"Shanghai Jiaotong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137640"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3570690.3570700"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00012"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463722"},{"key":"e_1_2_2_5_1","volume-title":"Sparse subspace clustering: Algorithm, theory, and applications","author":"Elhamifar Ehsan","year":"2013","unstructured":"Ehsan Elhamifar and Ren\u00e9 Vidal. 2013. Sparse subspace clustering: Algorithm, theory, and applications. IEEE transactions on pattern analysis and machine intelligence, Vol. 35, 11 (2013), 2765--2781."},{"key":"e_1_2_2_6_1","volume-title":"Community search: a meta-learning approach","author":"Fang Shuheng","unstructured":"Shuheng Fang, Kangfei Zhao, Guanghua Li, and Jeffrey Xu Yu. 2023. Community search: a meta-learning approach. In IEEE 39th ICDE. 2358--2371."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"e_1_2_2_8_1","volume-title":"International Workshop on Mobility Analytics for Spatio-temporal and Social Data. 1--21","author":"Fang Yixiang","year":"2017","unstructured":"Yixiang Fang and Reynold Cheng. 2017. On attributed community search. In International Workshop on Mobility Analytics for Spatio-temporal and Social Data. 1--21."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0482-5"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2845414"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0464-z"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447704"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723723"},{"key":"e_1_2_2_16_1","volume-title":"Inductive representation learning on large graphs. Advances in neural information processing systems","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017a. Inductive representation learning on large graphs. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_2_2_17_1","volume-title":"Inductive representation learning on large graphs. Advances in neural information processing systems","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017b. Inductive representation learning on large graphs. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543873.3587654"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856323"},{"key":"e_1_2_2_22_1","volume-title":"International Conference on Machine Learning. PMLR, 9833--9844","author":"Jaiswal Ajay Kumar","year":"2022","unstructured":"Ajay Kumar Jaiswal, Haoyu Ma, Tianlong Chen, Ying Ding, and Zhangyang Wang. 2022. Training your sparse neural network better with any mask. In International Conference on Machine Learning. PMLR, 9833--9844."},{"key":"e_1_2_2_23_1","volume-title":"Deep subspace clustering networks. Advances in neural information processing systems","author":"Ji Pan","year":"2017","unstructured":"Pan Ji, Tong Zhang, Hongdong Li, Mathieu Salzmann, and Ian Reid. 2017. Deep subspace clustering networks. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3514061.3514070"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526137"},{"key":"e_1_2_2_26_1","unstructured":"Thomas N Kipf and Max Welling. 2016. Semi-Supervised Classification with Graph Convolutional Networks. (2016)."},{"key":"e_1_2_2_27_1","first-page":"1","article-title":"Lassonet: A neural network with feature sparsity","volume":"22","author":"Lemhadri Ismael","year":"2021","unstructured":"Ismael Lemhadri, Feng Ruan, Louis Abraham, and Robert Tibshirani. 2021. Lassonet: A neural network with feature sparsity. Journal of Machine Learning Research, Vol. 22, 127 (2021), 1--29.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_2_28_1","volume-title":"Learning to discover social circles in ego networks. Advances in neural information processing systems","author":"Leskovec Jure","year":"2012","unstructured":"Jure Leskovec and Julian Mcauley. 2012. Learning to discover social circles in ego networks. Advances in neural information processing systems, Vol. 25 (2012)."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00936"},{"key":"e_1_2_2_30_1","volume-title":"COCLEP: Contrastive Learning-based Semi-Supervised Community Search","author":"Li Ling","year":"2023","unstructured":"Ling Li, Siqiang Luo, Yuhai Zhao, Caihua Shan, Zhengkui Wang, and Lu Qin. 2023. COCLEP: Contrastive Learning-based Semi-Supervised Community Search. IEEE 39th ICDE (2023)."},{"key":"e_1_2_2_31_1","volume-title":"Robust recovery of subspace structures by low-rank representation","author":"Liu Guangcan","year":"2012","unstructured":"Guangcan Liu, Zhouchen Lin, Shuicheng Yan, Ju Sun, Yong Yu, and Yi Ma. 2012. Robust recovery of subspace structures by low-rank representation. IEEE transactions on pattern analysis and machine intelligence, Vol. 35, 1 (2012), 171--184."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560485"},{"key":"e_1_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Vishal M Patel and Ren\u00e9 Vidal. 2014. Kernel sparse subspace clustering. In 2014 ieee international conference on image processing (icip). 2849--2853.","DOI":"10.1109\/ICIP.2014.7025576"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00015"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-017-1976-z"},{"key":"e_1_2_2_36_1","volume-title":"Overlapping Community Detection with Graph Neural Networks. Deep Learning on Graphs Workshop, KDD","author":"Shchur Oleksandr","year":"2019","unstructured":"Oleksandr Shchur and Stephan G\u00fcnnemann. 2019. Overlapping Community Detection with Graph Neural Networks. Deep Learning on Graphs Workshop, KDD (2019)."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2017.61"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615209"},{"key":"e_1_2_2_40_1","volume-title":"Paths-over-Graph: Knowledge Graph Empowered Large Language Model Reasoning. arXiv preprint arXiv:2410.14211","author":"Tan Xingyu","year":"2024","unstructured":"Xingyu Tan, Xiaoyang Wang, Qing Liu, Xiwei Xu, Xin Yuan, and Wenjie Zhang. 2024. Paths-over-Graph: Knowledge Graph Empowered Large Language Model Reasoning. arXiv preprint arXiv:2410.14211 (2024)."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1080\/10494820.2021.1875001"},{"key":"e_1_2_2_42_1","volume-title":"GRAPH ATTENTION NETWORKS. stat","author":"Velickovic Petar","year":"2018","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2018. GRAPH ATTENTION NETWORKS. stat, Vol. 1050 (2018), 4."},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526163"},{"key":"e_1_2_2_44_1","doi-asserted-by":"crossref","unstructured":"H Wang D Lian Y Zhang L Qin and X Lin. 2021a. GoGNN: Graph of graphs neural network for predicting structured entity interactions. (2021).","DOI":"10.24963\/ijcai.2020\/183"},{"key":"e_1_2_2_45_1","volume-title":"Efficient Unsupervised Community Search with Pre-trained Graph Transformer. arXiv preprint arXiv:2403.18869","author":"Wang Jianwei","year":"2024","unstructured":"Jianwei Wang, Kai Wang, Xuemin Lin, Wenjie Zhang, and Ying Zhang. 2024a. Efficient Unsupervised Community Search with Pre-trained Graph Transformer. arXiv preprint arXiv:2403.18869 (2024)."},{"key":"e_1_2_2_46_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3626738","article-title":"Neural Attributed Community Search at Billion Scale","volume":"1","author":"Wang Jianwei","year":"2024","unstructured":"Jianwei Wang, Kai Wang, Xuemin Lin, Wenjie Zhang, and Ying Zhang. 2024b. Neural Attributed Community Search at Billion Scale. Proceedings of the ACM on Management of Data, Vol. 1, 4 (2024), 1--25.","journal-title":"Proceedings of the ACM on Management of Data"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3675034.3675042"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-017-0051-3"},{"key":"e_1_2_2_49_1","first-page":"5758","article-title":"Dissecting the diffusion process in linear graph convolutional networks","volume":"34","author":"Wang Yifei","year":"2021","unstructured":"Yifei Wang, Yisen Wang, Jiansheng Yang, and Zhouchen Lin. 2021b. Dissecting the diffusion process in linear graph convolutional networks. Advances in Neural Information Processing Systems, Vol. 34 (2021), 5758--5769.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_2_50_1","first-page":"34024","article-title":"Understanding non-linearity in graph neural networks from the bayesian-inference perspective","volume":"35","author":"Wei Rongzhe","year":"2022","unstructured":"Rongzhe Wei, Haoteng Yin, Junteng Jia, Austin R Benson, and Pan Li. 2022. Understanding non-linearity in graph neural networks from the bayesian-inference perspective. Advances in Neural Information Processing Systems, Vol. 35 (2022), 34024--34038.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_2_51_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"6871","author":"Wu Felix","year":"2019","unstructured":"Felix Wu, Amauri Souza, Tianyi Zhang, Christopher Fifty, Tao Yu, and Kilian Weinberger. 2019. Simplifying Graph Convolutional Networks. In Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 97), Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.). 6861--6871."},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3681997"},{"key":"e_1_2_2_53_1","volume-title":"How Powerful are Graph Neural Networks?","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How Powerful are Graph Neural Networks? (2018)."},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00357"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599836"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2783933"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3709678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:20:21Z","timestamp":1774981221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,10]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,10]]}},"alternative-id":["10.1145\/3709678"],"URL":"https:\/\/doi.org\/10.1145\/3709678","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,10]]}}}