{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T02:04:00Z","timestamp":1791425040366,"version":"4.3.3"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>\n            Community search (CS) enables personalized community discovery and has found a wide spectrum of emerging applications such as setting up social events and friend recommendation. While CS has been extensively studied for conventional homogeneous networks, the problem for heterogeneous information networks (HINs) has received attention only recently. However, existing studies suffer from several limitations, e.g., they either require users to specify a meta-path or relational constraints, which pose great challenges to users who are not familiar with HINs. To address these limitations, in this paper, we systematically study the problem of CS over large star-schema HINs without asking users to specify these constraints; that is, given a set\n            <jats:italic>Q<\/jats:italic>\n            of query vertices with the same type, find the most-likely community from a star-schema HIN containing\n            <jats:italic>Q<\/jats:italic>\n            , in which all the vertices are with the same type and close relationships. To capture the close relationships among vertices of the community, we employ the meta-path-based core model, and maximize the number of shared meta-paths such that each of them results in a cohesive core containing\n            <jats:italic>Q.<\/jats:italic>\n            To enable efficient CS, we first develop online algorithms via exploiting the anti-monotonicity property of shared meta-paths. We further boost the efficiency by proposing a novel index and an efficient index-based algorithm with elegant pruning techniques. Extensive experiments on four real large star-schema HINs show that our solutions are effective and efficient for searching communities, and the index-based algorithm is much faster than the online algorithms.\n          <\/jats:p>","DOI":"10.14778\/3551793.3551795","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T22:25:03Z","timestamp":1664490303000},"page":"2307-2320","source":"Crossref","is-referenced-by-count":42,"title":["Effective community search over large star-schema heterogeneous information networks"],"prefix":"10.14778","volume":"15","author":[{"given":"Yangqin","family":"Jiang","sequence":"first","affiliation":[{"name":"The Chinese University of Hong, Kong, Shenzhen"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yixiang","family":"Fang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong, Kong, Shenzhen"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chenhao","family":"Ma","sequence":"additional","affiliation":[{"name":"The University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Cao","sequence":"additional","affiliation":[{"name":"University of New South Wales"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunshan","family":"Li","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik . 2003. An O (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 ( 2003 ). Vladimir Batagelj and Matjaz Zaversnik. 2003. An O (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324962"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746486"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00031"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983806"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3231751.3231755"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403114"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59419-0_2"},{"key":"e_1_2_1_9_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis. National security agency technical report 16, 3.1","author":"Cohen Jonathan","year":"2008","unstructured":"Jonathan Cohen . 2008 . Trusses: Cohesive subgraphs for social network analysis. National security agency technical report 16, 3.1 (2008). Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report 16, 3.1 (2008)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463722"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098036"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476258"},{"key":"e_1_2_1_14_1","volume-title":"Exploiting drug-disease relationships for computational drug repositioning. Briefings in bioinformatics 12, 4","author":"Dudley Joel T","year":"2011","unstructured":"Joel T Dudley , Tarangini Deshpande , and Atul J Butte . 2011. Exploiting drug-disease relationships for computational drug repositioning. Briefings in bioinformatics 12, 4 ( 2011 ), 303--311. Joel T Dudley, Tarangini Deshpande, and Atul J Butte. 2011. Exploiting drug-disease relationships for computational drug repositioning. Briefings in bioinformatics 12, 4 (2011), 303--311."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/313"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380756"},{"key":"e_1_2_1_19_1","volume-title":"Community detection in graphs. Physics reports 486, 3--5","author":"Fortunato Santo","year":"2010","unstructured":"Santo Fortunato . 2010. Community detection in graphs. Physics reports 486, 3--5 ( 2010 ), 75--174. Santo Fortunato. 2010. Community detection in graphs. Physics reports 486, 3--5 (2010), 75--174."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132993"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00072"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983748"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099626"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856323"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939815"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401969"},{"key":"e_1_2_1_28_1","volume-title":"Effective community search over large star-schema heterogeneous information networks (technical report). https:\/\/github.com\/ZzMeei\/CS-StarSchemaHIN\/blob\/master\/main.pdf","author":"Jiang Yangqin","year":"2022","unstructured":"Yangqin Jiang , Yixiang Fang , Chenhao Ma , Xin Cao , and Chunshan Li. 2022. Effective community search over large star-schema heterogeneous information networks (technical report). https:\/\/github.com\/ZzMeei\/CS-StarSchemaHIN\/blob\/master\/main.pdf ( 2022 ). Yangqin Jiang, Yixiang Fang, Chenhao Ma, Xin Cao, and Chunshan Li. 2022. Effective community search over large star-schema heterogeneous information networks (technical report). https:\/\/github.com\/ZzMeei\/CS-StarSchemaHIN\/blob\/master\/main.pdf (2022)."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00649-y"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380587"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482250"},{"key":"e_1_2_1_32_1","volume-title":"Laks VS Lakshmanan, and Xiaolin Han","author":"Ma Chenhao","year":"2022","unstructured":"Chenhao Ma , Yixiang Fang , Reynold Cheng , Laks VS Lakshmanan, and Xiaolin Han . 2022 . A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery. In SIGMOD. Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks VS Lakshmanan, and Xiaolin Han. 2022. A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery. In SIGMOD."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389697"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3483940"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741123"},{"key":"e_1_2_1_36_1","volume-title":"Finding and evaluating community structure in networks. Physical review E 69, 2","author":"Newman Mark EJ","year":"2004","unstructured":"Mark EJ Newman and Michelle Girvan . 2004. Finding and evaluating community structure in networks. Physical review E 69, 2 ( 2004 ), 026113. Mark EJ Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical review E 69, 2 (2004), 026113."},{"key":"e_1_2_1_37_1","volume-title":"Finding Top-r Influential Communities under Aggregation Function","author":"Peng You","unstructured":"You Peng , Song Bian , Rui Li , Sibo Wang , and Jeffrey Xu Yu. 2022. Finding Top-r Influential Communities under Aggregation Function . In ICDE. IEEE. You Peng, Song Bian, Rui Li, Sibo Wang, and Jeffrey Xu Yu. 2022. Finding Top-r Influential Communities under Aggregation Function. In ICDE. IEEE."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1101\/105197"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247618"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2598561"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662040"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339778"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140437"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516426"},{"key":"e_1_2_1_47_1","volume-title":"Pathselclus: Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. ACM Transactions on Knowledge Discovery from Data (TKDD) 7, 3","author":"Sun Yizhou","year":"2013","unstructured":"Yizhou Sun , Brandon Norick , Jiawei Han , Xifeng Yan , Philip S Yu , and Xiao Yu . 2013 . Pathselclus: Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. ACM Transactions on Knowledge Discovery from Data (TKDD) 7, 3 (2013), 1--23. Yizhou Sun, Brandon Norick, Jiawei Han, Xifeng Yan, Philip S Yu, and Xiao Yu. 2013. Pathselclus: Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. ACM Transactions on Knowledge Discovery from Data (TKDD) 7, 3 (2013), 1--23."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557107"},{"key":"e_1_2_1_49_1","volume-title":"Arnet-Miner: Extraction and Mining of Academic Social Networks. In KDD'08","author":"Tang Jie","year":"2008","unstructured":"Jie Tang , Jing Zhang , Limin Yao , Juanzi Li , Li Zhang , and Zhong Su . 2008 . Arnet-Miner: Extraction and Mining of Academic Social Networks. In KDD'08 . 990--998. Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zhang, and Zhong Su. 2008. Arnet-Miner: Extraction and Mining of Academic Social Networks. In KDD'08. 990--998."},{"key":"e_1_2_1_50_1","volume-title":"Simplifying Weighted Heterogeneous networks by extracting h-Structure via s-Degree. Scientific reports 9, 1","author":"Wang Ruby W","year":"2019","unstructured":"Ruby W Wang and Y Ye Fred . 2019. Simplifying Weighted Heterogeneous networks by extracting h-Structure via s-Degree. Scientific reports 9, 1 ( 2019 ), 1--8. Ruby W Wang and Y Ye Fred. 2019. Simplifying Weighted Heterogeneous networks by extracting h-Structure via s-Degree. Scientific reports 9, 1 (2019), 1--8."},{"key":"e_1_2_1_51_1","volume-title":"Heterogeneous Network Representation Learning: A Unified Framework with Survey and Benchmark. TKDE","author":"Yang Carl","year":"2020","unstructured":"Carl Yang , Yuxin Xiao , Yu Zhang , Yizhou Sun , and Jiawei Han . 2020. Heterogeneous Network Representation Learning: A Unified Framework with Survey and Benchmark. TKDE ( 2020 ). Carl Yang, Yuxin Xiao, Yu Zhang, Yizhou Sun, and Jiawei Han. 2020. Heterogeneous Network Representation Learning: A Unified Framework with Survey and Benchmark. TKDE (2020)."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2015.05.010"},{"key":"e_1_2_1_53_1","volume-title":"Participatory cultural mapping based on collective behavior in location based social networks. ACM Transactions on Intelligent Systems and Technology","author":"Yang Dingqi","year":"2015","unstructured":"Dingqi Yang , Daqing Zhang , and Bingqing Qu. 2015. Participatory cultural mapping based on collective behavior in location based social networks. ACM Transactions on Intelligent Systems and Technology ( 2015 ). in press. Dingqi Yang, Daqing Zhang, and Bingqing Qu. 2015. Participatory cultural mapping based on collective behavior in location based social networks. ACM Transactions on Intelligent Systems and Technology (2015). in press."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00083"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507230"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2783933"},{"key":"e_1_2_1_57_1","volume-title":"Efficient k-clique Listing with Set Intersection Speedup","author":"Yuan Zhirong","unstructured":"Zhirong Yuan , You Peng , Peng Cheng , Li Han , Xuemin Lin , Lei Chen , and Wenjie Zhang . 2022. Efficient k-clique Listing with Set Intersection Speedup . In ICDE. IEEE. Zhirong Yuan, You Peng, Peng Cheng, Li Han, Xuemin Lin, Lei Chen, and Wenjie Zhang. 2022. Efficient k-clique Listing with Set Intersection Speedup. In ICDE. IEEE."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300082"},{"key":"e_1_2_1_59_1","unstructured":"Yaping Zheng Shiyi Chen Xinni Zhang Xiaofeng Zhang Xiaofei Yang and Di Wang. 2020. Heterogeneous-Temporal Graph Convolutional Networks: Make the Community Detection Much Better. arXiv:1909.10248 [cs.LG]  Yaping Zheng Shiyi Chen Xinni Zhang Xiaofeng Zhang Xiaofei Yang and Di Wang. 2020. Heterogeneous-Temporal Graph Convolutional Networks: Make the Community Detection Much Better. arXiv:1909.10248 [cs.LG]"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407846"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487640"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.85"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3551793.3551795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:21:35Z","timestamp":1672222895000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3551793.3551795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":62,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.14778\/3551793.3551795"],"URL":"https:\/\/doi.org\/10.14778\/3551793.3551795","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,7]]}}}