{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T14:17:42Z","timestamp":1790259462852,"version":"4.1.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>\n            Community retrieval (CR) algorithms, which enable the extraction of subgraphs from large social networks (e.g., Facebook and Twitter), have attracted tremendous interest. Various CR solutions, such as\n            <jats:italic>k<\/jats:italic>\n            -core and\n            <jats:sc>codicil<\/jats:sc>\n            , have been proposed to obtain graphs whose vertices are closely related. In this paper, we propose the\n            <jats:italic>C-Explorer<\/jats:italic>\n            system to assist users in extracting, visualizing, and analyzing communities.\n            <jats:italic>C-Explorer<\/jats:italic>\n            provides online and interactive CR facilities, allowing a user to view her interesting graphs, indicate her required vertex\n            <jats:italic>q<\/jats:italic>\n            , and display the communities to which\n            <jats:italic>q<\/jats:italic>\n            belongs. A seminal feature of\n            <jats:italic>C-Explorer<\/jats:italic>\n            is that it uses an\n            <jats:italic>attributed graph<\/jats:italic>\n            , whose vertices are associated with labels and keywords, and looks for an\n            <jats:italic>attributed community<\/jats:italic>\n            (or AC), whose vertices are structurally and semantically related. Moreover,\n            <jats:italic>C-Explorer<\/jats:italic>\n            implements several state-of-the-art CR algorithms, as well as functions for analyzing their effectiveness. We plan to make\n            <jats:italic>C-Explorer<\/jats:italic>\n            an open-source web-based platform, and design API functions for software developers to test their CR algorithms in our system.\n          <\/jats:p>","DOI":"10.14778\/3137765.3137800","type":"journal-article","created":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T13:35:53Z","timestamp":1504791353000},"page":"1885-1888","source":"Crossref","is-referenced-by-count":22,"title":["C-explorer"],"prefix":"10.14778","volume":"10","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"}]},{"given":"Kai","family":"Huang","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544933"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055337"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983748"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824106"},{"key":"e_1_2_1_9_1","volume-title":"Finding and evaluating community structure in networks. Physical review E, 69(2):026113","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):026113 , 2004 . M. E. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488483"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544943"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213894"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007295"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3137765.3137800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:07:22Z","timestamp":1672222042000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3137765.3137800"}},"subtitle":["browsing communities in large graphs"],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":14,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["10.14778\/3137765.3137800"],"URL":"https:\/\/doi.org\/10.14778\/3137765.3137800","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}