{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T06:34:09Z","timestamp":1790750049528,"version":"4.1.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,8]]},"abstract":"<jats:p>\n            Given a graph\n            <jats:italic>G<\/jats:italic>\n            and a vertex\n            <jats:italic>q<\/jats:italic>\n            \u2208\n            <jats:italic>G<\/jats:italic>\n            , the\n            <jats:italic>community search<\/jats:italic>\n            query returns a subgraph of\n            <jats:italic>G<\/jats:italic>\n            that contains vertices related to\n            <jats:italic>q<\/jats:italic>\n            . Communities, which are prevalent in\n            <jats:italic>attributed graphs<\/jats:italic>\n            such as social networks and knowledge bases, can be used in emerging applications such as product advertisement and setting up of social events. In this paper, we investigate the\n            <jats:italic>attributed community query<\/jats:italic>\n            (or ACQ), which returns an\n            <jats:italic>attributed community<\/jats:italic>\n            (AC) for an\n            <jats:italic>attributed graph<\/jats:italic>\n            . The AC is a subgraph of\n            <jats:italic>G<\/jats:italic>\n            , which satisfies both\n            <jats:italic>structure cohesiveness<\/jats:italic>\n            (i.e., its vertices are tightly connected) and\n            <jats:italic>keyword cohesiveness<\/jats:italic>\n            (i.e., its vertices share common keywords). The AC enables a better understanding of how and why a community is formed (e.g., members of an AC have a common interest in music, because they all have the same keyword \"music\"). An AC can be \"personalized\"; for example, an ACQ user may specify that an AC returned should be related to some specific keywords like \"research\" and \"sports\".\n          <\/jats:p>\n          <jats:p>To enable efficient AC search, we develop the CL-tree index structure and three algorithms based on it. We evaluate our solutions on four large graphs, namely Flickr, DBLP, Tencent, and DBpedia. Our results show that ACs are more effective and efficient than existing community retrieval approaches. Moreover, an AC contains more precise and personalized information than that of existing community search and detection methods.<\/jats:p>","DOI":"10.14778\/2994509.2994538","type":"journal-article","created":{"date-parts":[[2016,9,6]],"date-time":"2016-09-06T15:27:03Z","timestamp":1473175623000},"page":"1233-1244","source":"Crossref","is-referenced-by-count":276,"title":["Effective community search for large attributed graphs"],"prefix":"10.14778","volume":"9","author":[{"given":"Yixiang","family":"Fang","sequence":"first","affiliation":[{"name":"The University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reynold","family":"Cheng","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siqiang","family":"Luo","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiafeng","family":"Hu","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Disjoint-set_data_structure.  https:\/\/en.wikipedia.org\/wiki\/Disjoint-set_data_structure."},{"key":"e_1_2_1_2_1","volume-title":"An o(m) algorithm for cores decomposition of networks. arXiv","author":"Batagelj V.","year":"2003","unstructured":"V. Batagelj and M. Zaversnik . An o(m) algorithm for cores decomposition of networks. arXiv , 2003 . V. Batagelj and M. Zaversnik. An o(m) algorithm for cores decomposition of networks. arXiv, 2003."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879034"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463722"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367929"},{"key":"e_1_2_1_7_1","volume-title":"K-core organization of complex networks. Physical review letters","author":"Dorogovtsev S. N.","year":"2006","unstructured":"S. N. Dorogovtsev K-core organization of complex networks. Physical review letters , 2006 . S. N. Dorogovtsev et al. K-core organization of complex networks. Physical review letters, 2006."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920878"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824048"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1177\/0165551514541614"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_1_12_1","volume-title":"Data mining: concepts and techniques","author":"Han J.","year":"2011","unstructured":"J. Han , M. Kamber , and J. Pei . Data mining: concepts and techniques . Elsevier , 2011 . J. Han, M. Kamber, and J. Pei. Data mining: concepts and techniques. Elsevier, 2011."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247516"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_2_1_16_1","volume-title":"VLDB","author":"Kacholia V.","year":"2005","unstructured":"V. Kacholia Bidirectional expansion for keyword search on graph databases . In VLDB , 2005 . V. Kacholia et al. Bidirectional expansion for keyword search on graph databases. In VLDB, 2005."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2021017.2021025"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735484"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553460"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401957"},{"key":"e_1_2_1_22_1","volume-title":"Finding and evaluating community structure in networks. Physical review E","author":"Newman M.","year":"2004","unstructured":"M. Newman Finding and evaluating community structure in networks. Physical review E , 2004 . M. Newman et al. Finding and evaluating community structure in networks. Physical review E, 2004."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488483"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187882"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_2_1_27_1","volume-title":"The new data and new challenges in multimedia research. arXiv:1503.01817","author":"Thomee B.","year":"2015","unstructured":"B. Thomee The new data and new challenges in multimedia research. arXiv:1503.01817 , 2015 . B. Thomee et al. The new data and new challenges in multimedia research. arXiv:1503.01817, 2015."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281271"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213894"},{"key":"e_1_2_1_30_1","unstructured":"Y. Fang etal Effective community search for large attributed graphs (technical report). http:\/\/www.cs.hku.hk\/research\/techreps\/document\/TR-2016-01.pdf.  Y. Fang et al. Effective community search for large attributed graphs (technical report). http:\/\/www.cs.hku.hk\/research\/techreps\/document\/TR-2016-01.pdf."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.167"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557120"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855072"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687709"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2994509.2994538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:55:04Z","timestamp":1672224904000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2994509.2994538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":34,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.14778\/2994509.2994538"],"URL":"https:\/\/doi.org\/10.14778\/2994509.2994538","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}