{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T16:12:08Z","timestamp":1782835928252,"version":"3.54.5"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"8","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:p>Recently, the topic of influential community search has gained much attention. Given a graph, it aims to find communities of vertices with high importance values from it. Existing works mainly focus on conventional homogeneous networks, where vertices are of the same type. Thus, they cannot be applied to heterogeneous information networks (HINs) like bibliographic networks and knowledge graphs, where vertices are of multiple types and their importance values are of heterogeneity (i.e., for vertices of different types, their importance meanings are also different). In this paper, we study the problem of influential community search over large HINs. We introduce a novel community model, called heterogeneous influential community (HIC), or a set of closely connected vertices that are of the same type and high importance values, using the meta-path-based core model. An HIC not only captures the importance of vertices in a community, but also considers the influence on meta-paths connecting them. To search the HICs, we mainly consider meta-paths with two and three vertex types. Then, we develop basic algorithms by iteratively peeling vertices with low importance values, and further propose advanced algorithms by identifying the key vertices and designing pruning strategies that allow us to quickly eliminate vertices with low importance values. Extensive experiments on four real large HINs show that our solutions are effective for searching HICs, and the advanced algorithms significantly outperform baselines.<\/jats:p>","DOI":"10.14778\/3594512.3594532","type":"journal-article","created":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T00:28:36Z","timestamp":1687480116000},"page":"2047-2060","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Influential Community Search over Large Heterogeneous Information Networks"],"prefix":"10.14778","volume":"16","author":[{"given":"Yingli","family":"Zhou","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":"Wensheng","family":"Luo","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shenzhen"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunming","family":"Ye","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology, Shenzhen"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,22]]},"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.14778\/3213880.3213881"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324962"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914855"},{"key":"e_1_2_1_5_1","volume-title":"Jeffrey Xu Yu, and Wenjie Zhang","author":"Chang Lijun","year":"2015","unstructured":"Lijun Chang , Xuemin Lin , Lu Qin , Jeffrey Xu Yu, and Wenjie Zhang . 2015 . Index-based optimal algorithms for computing steiner components with maximum connectivity. In SIGMOD. 459--474. Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, and Wenjie Zhang. 2015. Index-based optimal algorithms for computing steiner components with maximum connectivity. In SIGMOD. 459--474."},{"key":"e_1_2_1_6_1","volume-title":"Efficient and incremental clustering algorithms on star-schema heterogeneous graphs","author":"Chen Lu","unstructured":"Lu Chen , Yunjun Gao , Yuanliang Zhang , Christian S Jensen , and Bolong Zheng . 2019. Efficient and incremental clustering algorithms on star-schema heterogeneous graphs . In ICDE. IEEE , 256--267. Lu Chen, Yunjun Gao, Yuanliang Zhang, Christian S Jensen, and Bolong Zheng. 2019. Efficient and incremental clustering algorithms on star-schema heterogeneous graphs. In ICDE. IEEE, 256--267."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3231751.3231755"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Shu Chen Ran Wei Diana Popova and Alex Thomo. 2016. Efficient computation of importance based communities in web-scale networks using a single machine. In CIKM. 1553--1562.  Shu Chen Ran Wei Diana Popova and Alex Thomo. 2016. Efficient computation of importance based communities in web-scale networks using a single machine. In CIKM. 1553--1562.","DOI":"10.1145\/2983323.2983836"},{"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","volume-title":"Proceedings of the VLDB Endowment","author":"Dong Zheng","year":"2021","unstructured":"Zheng Dong , Xin Huang , Guorui Yuan , Hengshu Zhu , and Hui Xiong . 2021 . Butterfly-core community search over labeled graphs . Proceedings of the VLDB Endowment (2021). Zheng Dong, Xin Huang, Guorui Yuan, Hengshu Zhu, and Hui Xiong. 2021. Butterfly-core community search over labeled graphs. Proceedings of the VLDB Endowment (2021)."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Yixiang Fang Kai Wang Xuemin Lin and Wenjie Zhang. 2021. Cohesive subgraph search over big heterogeneous information networks: Applications challenges and solutions. In SIGMOD. 2829--2838.  Yixiang Fang Kai Wang Xuemin Lin and Wenjie Zhang. 2021. Cohesive subgraph search over big heterogeneous information networks: Applications challenges and solutions. In SIGMOD. 2829--2838.","DOI":"10.1145\/3448016.3457538"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380756"},{"key":"e_1_2_1_16_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_17_1","doi-asserted-by":"crossref","unstructured":"Edoardo Galimberti Francesco Bonchi and Francesco Gullo. 2017. Core decomposition and densest subgraph in multilayer networks. In CIKM. 1807--1816.  Edoardo Galimberti Francesco Bonchi and Francesco Gullo. 2017. Core decomposition and densest subgraph in multilayer networks. In CIKM. 1807--1816.","DOI":"10.1145\/3132847.3132993"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2730873"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Chengji Huang Yixiang Fang Xuemin Lin Xin Cao Wenjie Zhang and Maria Orlowska. 2022. Estimating Node Importance Values in Heterogeneous Information Networks. In ICDE. 846--858.  Chengji Huang Yixiang Fang Xuemin Lin Xin Cao Wenjie Zhang and Maria Orlowska. 2022. Estimating Node Importance Values in Heterogeneous Information Networks. In ICDE. 846--858.","DOI":"10.1109\/ICDE53745.2022.00068"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Han Huang Leilei Sun Bowen Du Chuanren Liu Weifeng Lv and Hui Xiong. 2021. Representation Learning on Knowledge Graphs for Node Importance Estimation. In KDD. 646--655.  Han Huang Leilei Sun Bowen Du Chuanren Liu Weifeng Lv and Hui Xiong. 2021. Representation Learning on Knowledge Graphs for Node Importance Estimation. In KDD. 646--655.","DOI":"10.1145\/3447548.3467342"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099626"},{"key":"e_1_2_1_23_1","first-page":"4","volume-title":"Proceedings of the VLDB Endowment 9","author":"Huang Xin","year":"2015","unstructured":"Xin Huang , Laks VS Lakshmanan , Jeffrey Xu Yu , and Hong Cheng . 2015 . Approximate Closest Community Search in Networks . Proceedings of the VLDB Endowment 9 , 4 (2015). Xin Huang, Laks VS Lakshmanan, Jeffrey Xu Yu, and Hong Cheng. 2015. Approximate Closest Community Search in Networks. Proceedings of the VLDB Endowment 9, 4 (2015)."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401969"},{"key":"e_1_2_1_25_1","first-page":"xxx","article-title":"Effective Community Search over Large Star-Schema Heterogeneous Information Networks","volume":"15","author":"Jiang Yangqin","year":"2022","unstructured":"Yangqin Jiang , Yixiang Fang , Chenhao Ma , Xin Cao , and ChunshanLi. 2022 . Effective Community Search over Large Star-Schema Heterogeneous Information Networks . Proceedings of the VLDB Endowment 15 , 11 (2022), xxx -- xxx . Yangqin Jiang, Yixiang Fang, Chenhao Ma, Xin Cao, and ChunshanLi. 2022. Effective Community Search over Large Star-Schema Heterogeneous Information Networks. Proceedings of the VLDB Endowment 15, 11 (2022), xxx--xxx.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_1_26_1","volume-title":"Xiaokui Xiao, Nong Xiao, and Zibin Zheng.","author":"Li Rong-Hua","year":"2018","unstructured":"Rong-Hua Li , Lu Qin , Fanghua Ye , Jeffrey Xu Yu , Xiaokui Xiao, Nong Xiao, and Zibin Zheng. 2018 . Skyline Community Search in Multi-valued Networks. In SIGMOD. ACM , 457--472. Rong-Hua Li, Lu Qin, Fanghua Ye, Jeffrey Xu Yu, Xiaokui Xiao, Nong Xiao, and Zibin Zheng. 2018. Skyline Community Search in Multi-valued Networks. In SIGMOD. ACM, 457--472."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735484"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00618-5"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s00778-017-0467-4","article-title":"Finding influential communities in massive networks","volume":"26","author":"Li Rong-Hua","year":"2017","unstructured":"Rong-Hua Li , Lu Qin , Jeffrey Xu Yu , and Rui Mao . 2017 . Finding influential communities in massive networks . The VLDB Journal 26 , 6 (2017), 751 -- 776 . Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, and Rui Mao. 2017. Finding influential communities in massive networks. The VLDB Journal 26, 6 (2017), 751--776.","journal-title":"The VLDB Journal"},{"key":"e_1_2_1_30_1","volume-title":"2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 97--108","author":"Liu Boge","year":"2021","unstructured":"Boge Liu , Fan Zhang , Wenjie Zhang , Xuemin Lin , and Ying Zhang . 2021 . Efficient community search with size constraint . In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 97--108 . Boge Liu, Fan Zhang, Wenjie Zhang, Xuemin Lin, and Ying Zhang. 2021. Efficient community search with size constraint. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 97--108."},{"key":"e_1_2_1_31_1","first-page":"12650","article-title":"Efficient approaches to top-r influential community search","volume":"8","author":"Luo Wensheng","year":"2020","unstructured":"Wensheng Luo , Xu Zhou , Jianye Yang , Peng Peng , Guoqing Xiao , and Yunjun Gao . 2020 . Efficient approaches to top-r influential community search . IEEE Internet of Things Journal 8 , 16 (2020), 12650 -- 12657 . Wensheng Luo, Xu Zhou, Jianye Yang, Peng Peng, Guoqing Xiao, and Yunjun Gao. 2020. Efficient approaches to top-r influential community search. IEEE Internet of Things Journal 8, 16 (2020), 12650--12657.","journal-title":"IEEE Internet of Things Journal"},{"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.1007\/s11390-019-1905-0"},{"key":"e_1_2_1_34_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_35_1","volume-title":"Highly Cited Researchers (h &gt","author":"World Universities Webometrics Ranking","unstructured":"Webometrics Ranking of World Universities . 2022. Highly Cited Researchers (h &gt ; 100) according to their Google Scholar Citations public profiles. https:\/\/www.webometrics.info\/en\/hlargerthan100. Webometrics Ranking of World Universities. 2022. Highly Cited Researchers (h &gt; 100) according to their Google Scholar Citations public profiles. https:\/\/www.webometrics.info\/en\/hlargerthan100."},{"key":"e_1_2_1_36_1","volume-title":"Tong Zhao, and Christos Faloutsos.","author":"Park Namyong","year":"2019","unstructured":"Namyong Park , Andrey Kan , Xin Luna Dong , Tong Zhao, and Christos Faloutsos. 2019 . Estimating node importance in knowledge graphs using graph neural networks. In KDD. 596--606. Namyong Park, Andrey Kan, Xin Luna Dong, Tong Zhao, and Christos Faloutsos. 2019. Estimating node importance in knowledge graphs using graph neural networks. In KDD. 596--606."},{"key":"e_1_2_1_37_1","volume-title":"Tong Zhao, and Christos Faloutsos.","author":"Park Namyong","year":"2020","unstructured":"Namyong Park , Andrey Kan , Xin Luna Dong , Tong Zhao, and Christos Faloutsos. 2020 . Multiimport : Inferring node importance in a knowledge graph from multiple input signals. In KDD. 503--512. Namyong Park, Andrey Kan, Xin Luna Dong, Tong Zhao, and Christos Faloutsos. 2020. Multiimport: Inferring node importance in a knowledge graph from multiple input signals. In KDD. 503--512."},{"key":"e_1_2_1_38_1","volume-title":"2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE","author":"Peng You","year":"2022","unstructured":"You Peng , Song Bian , Rui Li , Sibo Wang , and Jeffrey Xu Yu . 2022 . Finding Top-r Influential Communities under Aggregation Functions . In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE , 1941--1954. You Peng, Song Bian, Rui Li, Sibo Wang, and Jeffrey Xu Yu. 2022. Finding Top-r Influential Communities under Aggregation Functions. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 1941--1954."},{"key":"e_1_2_1_39_1","volume-title":"Database Systems for Advanced Applications: 26th International Conference, DASFAA 2021, Taipei, Taiwan, April 11--14, 2021, Proceedings, Part I. Springer, 158--173","author":"Qiao Lianpeng","year":"2021","unstructured":"Lianpeng Qiao , Zhiwei Zhang , Ye Yuan , Chen Chen , and Guoren Wang . 2021 . Keyword-centric community search over large heterogeneous information networks . In Database Systems for Advanced Applications: 26th International Conference, DASFAA 2021, Taipei, Taiwan, April 11--14, 2021, Proceedings, Part I. Springer, 158--173 . Lianpeng Qiao, Zhiwei Zhang, Ye Yuan, Chen Chen, and Guoren Wang. 2021. Keyword-centric community search over large heterogeneous information networks. In Database Systems for Advanced Applications: 26th International Conference, DASFAA 2021, Taipei, Taiwan, April 11--14, 2021, Proceedings, Part I. Springer, 158--173."},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Chuan Shi Xiangnan Kong Philip S Yu Sihong Xie and Bin Wu. 2012. Relevance search in heterogeneous networks. In EDBT. 180--191.  Chuan Shi Xiangnan Kong Philip S Yu Sihong Xie and Bin Wu. 2012. Relevance search in heterogeneous networks. In EDBT. 180--191.","DOI":"10.1145\/2247596.2247618"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2598561"},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Chuan Shi Ran Wang Yitong Li Philip S Yu and Bin Wu. 2014. Ranking-based clustering on general heterogeneous information networks by network projection. In CIKM. 699--708.  Chuan Shi Ran Wang Yitong Li Philip S Yu and Bin Wu. 2014. Ranking-based clustering on general heterogeneous information networks by network projection. In CIKM. 699--708.","DOI":"10.1145\/2661829.2662040"},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Chuan Shi Chong Zhou Xiangnan Kong Philip S Yu Gang Liu and Bai Wang. 2012. Heterecom: a semantic-based recommendation system in heterogeneous networks. In KDD. 1552--1555.  Chuan Shi Chong Zhou Xiangnan Kong Philip S Yu Gang Liu and Bai Wang. 2012. Heterecom: a semantic-based recommendation system in heterogeneous networks. In KDD. 1552--1555.","DOI":"10.1145\/2339530.2339778"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_2_1_45_1","volume-title":"Relation strength-aware clustering of heterogeneous information networks with incomplete attributes. arXiv preprint arXiv:1201.6563","author":"Sun Yizhou","year":"2012","unstructured":"Yizhou Sun , Charu C Aggarwal , and Jiawei Han . 2012. Relation strength-aware clustering of heterogeneous information networks with incomplete attributes. arXiv preprint arXiv:1201.6563 ( 2012 ). Yizhou Sun, Charu C Aggarwal, and Jiawei Han. 2012. Relation strength-aware clustering of heterogeneous information networks with incomplete attributes. arXiv preprint arXiv:1201.6563 (2012)."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"e_1_2_1_47_1","unstructured":"Yizhou Sun Jiawei Han Peixiang Zhao Zhijun Yin Hong Cheng and Tianyi Wu. 2009. Rankclus: integrating clustering with ranking for heterogeneous information network analysis. In EDBT. 565--576.  Yizhou Sun Jiawei Han Peixiang Zhao Zhijun Yin Hong Cheng and Tianyi Wu. 2009. Rankclus: integrating clustering with ranking for heterogeneous information network analysis. In EDBT. 565--576."},{"key":"e_1_2_1_48_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_49_1","unstructured":"Yizhou Sun Yintao Yu and Jiawei Han. 2009. Ranking-based clustering of heterogeneous information networks with star network schema. In KDD. 797--806.  Yizhou Sun Yintao Yu and Jiawei Han. 2009. Ranking-based clustering of heterogeneous information networks with star network schema. In KDD. 797--806."},{"key":"e_1_2_1_50_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_51_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_52_1","unstructured":"Wikipedia. 2020. Citation impact. https:\/\/en.wikipedia.org\/wiki\/Citation_impact.  Wikipedia. 2020. Citation impact. https:\/\/en.wikipedia.org\/wiki\/Citation_impact."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-021-00163-3"},{"key":"e_1_2_1_54_1","unstructured":"Xiaoliang Xu Jun Liu Yuxiang Wang and Xiangyu Ke. 2022. Academic Expert Finding via (K P)-Core based Embedding over Heterogeneous Graphs. In ICDE.  Xiaoliang Xu Jun Liu Yuxiang Wang and Xiangyu Ke. 2022. Academic Expert Finding via (K P)-Core based Embedding over Heterogeneous Graphs. In ICDE."},{"key":"e_1_2_1_55_1","volume-title":"Effective and efficient truss computation over large heterogeneous information networks","author":"Yang Yixing","unstructured":"Yixing Yang , Yixiang Fang , Xuemin Lin , and Wenjie Zhang . 2020. Effective and efficient truss computation over large heterogeneous information networks . In ICDE. IEEE , 901--912. Yixing Yang, Yixiang Fang, Xuemin Lin, and Wenjie Zhang. 2020. Effective and efficient truss computation over large heterogeneous information networks. In ICDE. IEEE, 901--912."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457407"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507230"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2783933"},{"key":"e_1_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Yikai Zhang and Jeffrey Xu Yu. 2019. Unboundedness and efficiency of truss maintenance in evolving graphs. In SIGMOD. 1024--1041.  Yikai Zhang and Jeffrey Xu Yu. 2019. Unboundedness and efficiency of truss maintenance in evolving graphs. In SIGMOD. 1024--1041.","DOI":"10.1145\/3299869.3300082"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407846"},{"key":"e_1_2_1_61_1","unstructured":"Yingli Zhou Yixiang Fang Wensheng Luo and Yunming Ye. 2022. Influential Community Search over Large Heterogeneous Information Networks (technical report). https:\/\/drive.google.com\/file\/d\/1lUpNkra8mR5natRhtmUEhwlJf732W9x\/view?usp=share_link.  Yingli Zhou Yixiang Fang Wensheng Luo and Yunming Ye. 2022. Influential Community Search over Large Heterogeneous Information Networks (technical report). https:\/\/drive.google.com\/file\/d\/1lUpNkra8mR5natRhtmUEhwlJf732W9x\/view?usp=share_link."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487640"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3594512.3594532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T00:31:40Z","timestamp":1687480300000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3594512.3594532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":62,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["10.14778\/3594512.3594532"],"URL":"https:\/\/doi.org\/10.14778\/3594512.3594532","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2023,4]]},"assertion":[{"value":"2023-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}