{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:57:31Z","timestamp":1775638651074,"version":"3.50.1"},"reference-count":80,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2020,2]]},"abstract":"<jats:p>\n            Recently, the topic of community search (CS) has gained plenty of attention. Given a query vertex, CS looks for a dense subgraph that contains it. Existing studies mainly focus on homogeneous graphs in which vertices are of the same type, and cannot be directly applied to heterogeneous information networks (HINs) that consist of multi-typed, interconnected objects, such as the bibliographic networks and knowledge graphs. In this paper, we study the problem of community search over large HINs; that is, given a query vertex\n            <jats:italic>q<\/jats:italic>\n            , find a community from an HIN containing\n            <jats:italic>q<\/jats:italic>\n            , in which all the vertices are with the same type of\n            <jats:italic>q<\/jats:italic>\n            and have close relationships.\n          <\/jats:p>\n          <jats:p>\n            To model the relationship between two vertices of the same type, we adopt the well-known concept of\n            <jats:italic>meta-path<\/jats:italic>\n            , which is a sequence of relations defined between different types of vertices. We then measure the cohesiveness of the community by extending the classic minimum degree metric with a meta-path. We further propose efficient query algorithms for finding communities using these cohesiveness metrics. We have performed extensive experiments on five real large HINs, and the results show that the proposed solutions are effective for searching communities. Moreover, they are much faster than the baseline solutions.\n          <\/jats:p>","DOI":"10.14778\/3380750.3380756","type":"journal-article","created":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T21:49:08Z","timestamp":1583963348000},"page":"854-867","source":"Crossref","is-referenced-by-count":129,"title":["Effective and efficient community search over large heterogeneous information networks"],"prefix":"10.14778","volume":"13","author":[{"given":"Yixiang","family":"Fang","sequence":"first","affiliation":[{"name":"University of New South Wales, Australia"}]},{"given":"Yixing","family":"Yang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Australia"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of New South Wales, Australia"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"University of New South Wales, Australia"}]},{"given":"Xin","family":"Cao","sequence":"additional","affiliation":[{"name":"University of New South Wales, Australia"}]}],"member":"320","published-online":{"date-parts":[[2020,3,11]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"https:\/\/en.wildpedia.org\/wiki\/Disjoint-set_data_structure.  https:\/\/en.wildpedia.org\/wiki\/Disjoint-set_data_structure."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-7091-1797-2_6","volume-title":"Social Networks: Analysis and Case Studies","author":"Amelio A.","year":"2014","unstructured":"A. Amelio and C. Pizzuti . Overlapping community discovery methods: A survey . In Social Networks: Analysis and Case Studies , pages 105 -- 125 . Springer , 2014 . A. Amelio and C. Pizzuti. Overlapping community discovery methods: A survey. In Social Networks: Analysis and Case Studies, pages 105--125. Springer, 2014."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1185448.1185512"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.03.072"},{"key":"e_1_2_1_5_1","volume-title":"An o(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049","author":"Batagelj V.","year":"2003","unstructured":"V. Batagelj and M. Zaversnik . An o(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 , 2003 . V. Batagelj and M. Zaversnik. An o(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049, 2003."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324962"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746486"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00031"},{"issue":"9","key":"e_1_2_1_9_1","first-page":"1233","article-title":"Maximum co-located community search in large scale social networks","volume":"11","author":"Chen L.","year":"2018","unstructured":"L. Chen , C. Liu , R. Zhou , J. Li , X. Yang , and B. Wang . Maximum co-located community search in large scale social networks . PVLDB , 11 ( 9 ): 1233 -- 1246 , 2018 . L. Chen, C. Liu, R. Zhou, J. Li, X. Yang, and B. Wang. Maximum co-located community search in large scale social networks. PVLDB, 11(9):1233--1246, 2018.","journal-title":"PVLDB"},{"issue":"8","key":"e_1_2_1_10_1","first-page":"1624","article-title":"Exploring communities in large profiled graphs","volume":"31","author":"Chen Y.","year":"2018","unstructured":"Y. Chen , Y. Fang , R. Cheng , Y. Li , X. Chen , and J. Zhang . Exploring communities in large profiled graphs . TKDE , 31 ( 8 ): 1624 -- 1629 , 2018 . Y. Chen, Y. Fang, R. Cheng, Y. Li, X. Chen, and J. Zhang. Exploring communities in large profiled graphs. TKDE, 31(8):1624--1629, 2018.","journal-title":"TKDE"},{"key":"e_1_2_1_11_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis. National security agency technical report, 16:3--1","author":"Cohen J.","year":"2008","unstructured":"J. Cohen . Trusses: Cohesive subgraphs for social network analysis. National security agency technical report, 16:3--1 , 2008 . J. Cohen. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report, 16:3--1, 2008."},{"key":"e_1_2_1_12_1","first-page":"651","volume-title":"Section 26.2: The ford-fulkerson method. Introduction to algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Section 26.2: The ford-fulkerson method. Introduction to algorithms , pages 651 -- 664 , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Section 26.2: The ford-fulkerson method. Introduction to algorithms, pages 651--664, 2001."},{"key":"e_1_2_1_13_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to algorithms . MIT press , 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT press, 2009."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.10133"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"e_1_2_1_16_1","first-page":"277","volume-title":"SIGMOD","author":"W. Cui","year":"2013","unstructured":"W. Cui et al. Online search of overlapping communities . In SIGMOD , pages 277 -- 288 , 2013 . W. Cui et al. Online search of overlapping communities. In SIGMOD, pages 277--288, 2013."},{"key":"e_1_2_1_17_1","volume-title":"Robust graph-based semisupervised learning for noisy labeled data via maximum correntropy criterion","author":"Du B.","year":"2018","unstructured":"B. Du , T. Xinyao , Z. Wang , L. Zhang , and D. Tao . Robust graph-based semisupervised learning for noisy labeled data via maximum correntropy criterion . IEEE transactions on cybernetics, 49(4):1440--1453, 2018 . B. Du, T. Xinyao, Z. Wang, L. Zhang, and D. Tao. Robust graph-based semisupervised learning for noisy labeled data via maximum correntropy criterion. IEEE transactions on cybernetics, 49(4):1440--1453, 2018."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbr013"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00229-6"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1074\/mcp.M113.031500"},{"key":"e_1_2_1_21_1","first-page":"1","volume-title":"International Workshop on Mobility Analytics for Spatio-temporal and Social Data of PVLDB 2017","author":"Fang Y.","year":"2017","unstructured":"Y. Fang and R. Cheng . On attributed community search . In International Workshop on Mobility Analytics for Spatio-temporal and Social Data of PVLDB 2017 , pages 1 -- 21 . Springer , 2017 . Y. Fang and R. Cheng. On attributed community search. In International Workshop on Mobility Analytics for Spatio-temporal and Social Data of PVLDB 2017, pages 1--21. Springer, 2017."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0482-5"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055337"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137800"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2845414"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2872982"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1177\/0165551514541614"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.46"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983748"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2730873"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099626"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856323"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939815"},{"key":"e_1_2_1_39_1","volume-title":"Network community detection: A review and visual survey. arXiv preprint arXiv.1708.00977","author":"Khan B. S.","year":"2017","unstructured":"B. S. Khan and M. A. Niazi . Network community detection: A review and visual survey. arXiv preprint arXiv.1708.00977 , 2017 . B. S. Khan and M. A. Niazi. Network community detection: A review and visual survey. arXiv preprint arXiv.1708.00977, 2017."},{"key":"e_1_2_1_40_1","first-page":"631","volume-title":"WWW","author":"Leskovec J.","year":"2010","unstructured":"J. Leskovec , K. J. Lang , and M. Mahoney . Empirical comparison of algorithms for network community detection . In WWW , pages 631 -- 640 . ACM, 2010 . J. Leskovec, K. J. Lang, and M. Mahoney. Empirical comparison of algorithms for network community detection. In WWW, pages 631--640. ACM, 2010."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183736"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735484"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850472"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313522"},{"key":"e_1_2_1_45_1","volume-title":"Feature learning using spatial-spectral hypergraph discriminant analysis for hyperspectral image","author":"Luo F.","year":"2018","unstructured":"F. Luo , B. Du , L. Zhang , L. Zhang , and D. Tao . Feature learning using spatial-spectral hypergraph discriminant analysis for hyperspectral image . IEEE transactions on cybernetics, 49(7):2406--2419, 2018 . F. Luo, B. Du, L. Zhang, L. Zhang, and D. Tao. Feature learning using spatial-spectral hypergraph discriminant analysis for hyperspectral image. IEEE transactions on cybernetics, 49(7):2406--2419, 2018."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364330"},{"key":"e_1_2_1_47_1","volume-title":"SIGMOD. ACM","author":"Ma C.","year":"2020","unstructured":"C. Ma , Y. Fang , R. Cheng , L. V. Lakshmanan , W. Zhang , and X. Lin . Efficient algorithms for densest subgraph discovery on large directed graphs . In SIGMOD. ACM , 2020 . C. Ma, Y. Fang, R. Cheng, L. V. Lakshmanan, W. Zhang, and X. Lin. Efficient algorithms for densest subgraph discovery on large directed graphs. In SIGMOD. ACM, 2020."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741123"},{"key":"e_1_2_1_49_1","volume-title":"Finding and evaluating community structure in networks. Physical review E, 69(2):026--113","author":"Newman M. E.","year":"2004","unstructured":"M. E. Newman and M. Girvan . Finding and evaluating community structure in networks. Physical review E, 69(2):026--113 , 2004 . M. E. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical review E, 69(2):026--113, 2004."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2011.07.001"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372720"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00110"},{"key":"e_1_2_1_54_1","volume-title":"Efficient detection of communities in biological bipartite networks","author":"Pesantez-Cabrera P.","year":"2017","unstructured":"P. Pesantez-Cabrera and A. Kalyanaraman . Efficient detection of communities in biological bipartite networks . IEEE\/ACM transactions on computational biology and bioinformatics, 16(1):258--271, 2017 . P. Pesantez-Cabrera and A. Kalyanaraman. Efficient detection of communities in biological bipartite networks. IEEE\/ACM transactions on computational biology and bioinformatics, 16(1):258--271, 2017."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"key":"e_1_2_1_56_1","volume-title":"Social Network Analysis: A Handbook","author":"Scott J.","year":"2000","unstructured":"J. Scott . Social Network Analysis: A Handbook . Sage Publications , 2000 . J. Scott. Social Network Analysis: A Handbook. Sage Publications, 2000."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2598561"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662040"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140437"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516426"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339738"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557107"},{"key":"e_1_2_1_67_1","first-page":"1","volume-title":"World Wide Web","author":"Wan G.","year":"2019","unstructured":"G. Wan , B. Du , S. Pan , and J. Wu . Adaptive knowledge subgraph ensemble for robust and trustworthy knowledge graph completion . World Wide Web , pages 1 -- 20 , 2019 . G. Wan, B. Du, S. Pan, and J. Wu. Adaptive knowledge subgraph ensemble for robust and trustworthy knowledge graph completion. World Wide Web, pages 1--20, 2019."},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00030"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339497"},{"key":"e_1_2_1_70_1","volume-title":"Efficient bitruss decomposition for large-scale bipartite graphs","author":"Wang K.","year":"2020","unstructured":"K. Wang , X. Lin , L. Qin , W. Zhang , and Y. Zhang . Efficient bitruss decomposition for large-scale bipartite graphs . In ICDE. IEEE , 2020 . K. Wang, X. Lin, L. Qin, W. Zhang, and Y. Zhang. Efficient bitruss decomposition for large-scale bipartite graphs. In ICDE. IEEE, 2020."},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.01.011"},{"issue":"1","key":"e_1_2_1_72_1","first-page":"142","article-title":"Redundancy reduction for prevalent co-location patterns","volume":"30","author":"Wang L.","year":"2017","unstructured":"L. Wang , X. Bao , and L. Zhou . Redundancy reduction for prevalent co-location patterns . TKDE , 30 ( 1 ): 142 -- 155 , 2017 . L. Wang, X. Bao, and L. Zhou. Redundancy reduction for prevalent co-location patterns. TKDE, 30(1):142--155, 2017.","journal-title":"TKDE"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0646-2"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752948"},{"key":"e_1_2_1_75_1","unstructured":"Y. Fang Y. Yang W. Zhang X. Lin X. Cao. Effective and efficient community search over large heterogeneous information networks (technical report). http:\/\/www.cse.unsw.edu.au\/~z3525370\/csh.pdf.  Y. Fang Y. Yang W. Zhang X. Lin X. Cao. Effective and efficient community search over large heterogeneous information networks (technical report). http:\/\/www.cse.unsw.edu.au\/~z3525370\/csh.pdf."},{"key":"e_1_2_1_76_1","first-page":"745","volume-title":"International Conference on Data Mining","author":"Yang J.","year":"2012","unstructured":"J. Yang and J. Leskovec . Defining and evaluating network communities based on ground-truth . In International Conference on Data Mining , pages 745 -- 754 , 2012 . J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-truth. In International Conference on Data Mining, pages 745--754, 2012."},{"key":"e_1_2_1_77_1","volume-title":"Effective and efficient truss computation over large heterogeneous information networks","author":"Yang Y.","year":"2020","unstructured":"Y. Yang , Y. Fang , X. Lin , and W. Zhang . Effective and efficient truss computation over large heterogeneous information networks . In ICDE. IEEE , 2020 . Y. Yang, Y. Fang, X. Lin, and W. Zhang. Effective and efficient truss computation over large heterogeneous information networks. In ICDE. IEEE, 2020."},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2783933"},{"key":"e_1_2_1_79_1","first-page":"414","volume-title":"APWeb","author":"Zhang B.","year":"2016","unstructured":"B. Zhang , T. Nie , D. Shen , Y. Kou , G. Yu , and Z. Zhou . A graph clustering algorithm for citation networks . In APWeb , pages 414 -- 418 . Springer , 2016 . B. Zhang, T. Nie, D. Shen, Y. Kou, G. Yu, and Z. Zhou. A graph clustering algorithm for citation networks. In APWeb, pages 414--418. Springer, 2016."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300082"},{"key":"e_1_2_1_81_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\/3380750.3380756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:30:26Z","timestamp":1672219826000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3380750.3380756"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":80,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["10.14778\/3380750.3380756"],"URL":"https:\/\/doi.org\/10.14778\/3380750.3380756","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2020,2]]}}}