{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T08:12:00Z","timestamp":1782979920618,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Fundamental Research Funds for the Central Universities","award":["2042019kf0224"],"award-info":[{"award-number":["2042019kf0224"]}]},{"name":"grants of Natural Science Foundation","award":["61972291 and 6170243"],"award-info":[{"award-number":["61972291 and 6170243"]}]},{"name":"Natural Science Foundation of Hubei Province","award":["2018CFB519"],"award-info":[{"award-number":["2018CFB519"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3412006","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T07:01:44Z","timestamp":1603090904000},"page":"1913-1922","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["When Structure Meets Keywords: Cohesive Attributed Community Search"],"prefix":"10.1145","author":[{"given":"Yuanyuan","family":"Zhu","sequence":"first","affiliation":[{"name":"Wuhan university, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"He","sequence":"additional","affiliation":[{"name":"Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junhao","family":"Ye","sequence":"additional","affiliation":[{"name":"Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[{"name":"University of Technology Sydney, Sydney, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137640"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2015.9"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/b106453"},{"key":"e_1_3_2_2_4_1","volume-title":"Lu Qin, Xuemin Lin, Chengfei Liu, and Weifa Liang.","author":"Chang Lijun","year":"2013","unstructured":"Lijun Chang , Jeffrey Xu Yu , Lu Qin, Xuemin Lin, Chengfei Liu, and Weifa Liang. 2013 . Efficiently computing k-edge connected components via graph decomposition. In SIGMOD. 205--216. Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin, Chengfei Liu, and Weifa Liang. 2013. Efficiently computing k-edge connected components via graph decomposition. In SIGMOD. 205--216."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Lu Chen Chengfei Liu Kewen Liao Jianxin Li and Rui Zhou. 2019. Contextual Community Search Over Large Social Networks. In ICDE. 88--99.  Lu Chen Chengfei Liu Kewen Liao Jianxin Li and Rui Zhou. 2019. Contextual Community Search Over Large Social Networks. In ICDE. 88--99.","DOI":"10.1109\/ICDE.2019.00017"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"James Cheng Yiping Ke Shumo Chu and M. Tamer\u00d6zsu. 2011. Efficient core decomposition in massive networks. In ICDE. 51--62.  James Cheng Yiping Ke Shumo Chu and M. Tamer\u00d6zsu. 2011. Efficient core decomposition in massive networks. In ICDE. 51--62.","DOI":"10.1109\/ICDE.2011.5767911"},{"key":"e_1_3_2_2_8_1","unstructured":"Wanyun Cui Yanghua Xiao Haixun Wang and Wei Wang. 2014. Local search of communities in large graphs. In SIGMOD. 991--1002.  Wanyun Cui Yanghua Xiao Haixun Wang and Wei Wang. 2014. Local search of communities in large graphs. In SIGMOD. 991--1002."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994538"},{"key":"e_1_3_2_2_10_1","volume-title":"Community detection in graphs. Physics reports","author":"Fortunato Santo","year":"2010","unstructured":"Santo Fortunato . 2010. Community detection in graphs. Physics reports , Vol. 486 , 3 ( 2010 ), 75--174. Santo Fortunato. 2010. Community detection in graphs. Physics reports, Vol. 486, 3 (2010), 75--174."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Jiawei Han Jian Pei and Yiwen Yin. 2000. Mining Frequent Patterns without Candidate Generation. In SIGMOD. 1--12.  Jiawei Han Jian Pei and Yiwen Yin. 2000. Mining Frequent Patterns without Candidate Generation. In SIGMOD. 1--12.","DOI":"10.1145\/335191.335372"},{"key":"e_1_3_2_2_12_1","unstructured":"Jiafeng Hu Xiaowei Wu Reynold Cheng Siqiang Luo and Yixiang Fang. 2016. Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs. In CIKM. 1241--1250.  Jiafeng Hu Xiaowei Wu Reynold Cheng Siqiang Luo and Yixiang Fang. 2016. Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs. In CIKM. 1241--1250."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Xin Huang Hong Cheng Lu Qin Wentao Tian and Jeffrey Xu Yu. 2014. Querying k-truss community in large and dynamic graphs. In SIGMOD. 1311--1322.  Xin Huang Hong Cheng Lu Qin Wentao Tian and Jeffrey Xu Yu. 2014. Querying k-truss community in large and dynamic graphs. In SIGMOD. 1311--1322.","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099626"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856323"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850471"},{"key":"e_1_3_2_2_17_1","volume-title":"Lakshmanan","author":"Lee Pei","year":"2016","unstructured":"Pei Lee and Laks V. S . Lakshmanan . 2016 . Query-Driven Maximum Quasi-Clique Search. In ICDM. 522--530. Pei Lee and Laks V. S. Lakshmanan. 2016. Query-Driven Maximum Quasi-Clique Search. In ICDM. 522--530."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-018-0068-2"},{"key":"e_1_3_2_2_19_1","first-page":"937","article-title":"VAC","author":"Liu Qing","year":"2020","unstructured":"Qing Liu , Yifan Zhu , Minjun Zhao , Xin Huang , Jianliang Xu , and Yunjun Gao . 2020 . VAC : Vertex-Centric Attributed Community Search. In ICDE. 937 - 948 . Qing Liu, Yifan Zhu, Minjun Zhao, Xin Huang, Jianliang Xu, and Yunjun Gao. 2020. VAC: Vertex-Centric Attributed Community Search. In ICDE. 937-948.","journal-title":"Vertex-Centric Attributed Community Search. In ICDE."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Yiye Ruan David Fuhry and Srinivasan Parthasarathy. 2013. Efficient community detection in large networks using content and links. In WWW. 1089--1098.  Yiye Ruan David Fuhry and Srinivasan Parthasarathy. 2013. Efficient community detection in large networks using content and links. In WWW. 1089--1098.","DOI":"10.1145\/2488388.2488483"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021927"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Mauro Sozio and Aristides Gionis. 2010. The community-search problem and how to plan a successful cocktail party. In SIGKDD. 939--948.  Mauro Sozio and Aristides Gionis. 2010. The community-search problem and how to plan a successful cocktail party. In SIGKDD. 939--948.","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Hanghang Tong and Christos Faloutsos. 2006. Center-piece subgraphs: problem definition and fast solutions. In SIGKDD. 404--413.  Hanghang Tong and Christos Faloutsos. 2006. Center-piece subgraphs: problem definition and fast solutions. In SIGKDD. 404--413.","DOI":"10.1145\/1150402.1150448"},{"key":"e_1_3_2_2_24_1","volume-title":"Forbidden Nodes Aware Community Search","author":"Wang Chaokun","unstructured":"Chaokun Wang and Junchao Zhu . 2019. Forbidden Nodes Aware Community Search . In AAAI. AAAI Press , 758--765. Chaokun Wang and Junchao Zhu. 2019. Forbidden Nodes Aware Community Search. In AAAI. AAAI Press, 758--765."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Dong Wen Lu Qin Ying Zhang Lijun Chang and Ling Chen. 2019. Enumerating k-Vertex Connected Components in Large Graphs. In ICDE. 52--63.  Dong Wen Lu Qin Ying Zhang Lijun Chang and Ling Chen. 2019. Enumerating k-Vertex Connected Components in Large Graphs. In ICDE. 52--63.","DOI":"10.1109\/ICDE.2019.00014"},{"key":"e_1_3_2_2_27_1","first-page":"798","article-title":"Robust Local Community Detection","volume":"8","author":"Wu Yubao","year":"2015","unstructured":"Yubao Wu , Ruoming Jin , Jing Li , and Xiang Zhang . 2015 . Robust Local Community Detection : On Free Rider Effect and Its Elimination. PVLDB , Vol. 8 , 7 (2015), 798 -- 809 . Yubao Wu, Ruoming Jin, Jing Li, and Xiang Zhang. 2015. Robust Local Community Detection: On Free Rider Effect and Its Elimination. PVLDB, Vol. 8, 7 (2015), 798--809.","journal-title":"On Free Rider Effect and Its Elimination. PVLDB"},{"key":"e_1_3_2_2_28_1","volume-title":"Szymanski","author":"Xie Jierui","year":"2013","unstructured":"Jierui Xie , Stephen Kelley , and Boleslaw K . Szymanski . 2013 . Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput. Surv ., Vol. 45 , 4 (2013), 43:1--43:35. Jierui Xie, Stephen Kelley, and Boleslaw K. Szymanski. 2013. Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput. Surv., Vol. 45, 4 (2013), 43:1--43:35."},{"key":"e_1_3_2_2_29_1","first-page":"901","article-title":"Effective and efficient truss computation over large heterogeneous information networks","author":"Yang Yixing","year":"2020","unstructured":"Yixing Yang , Yixiang Fang , Xuemin Lin , and Wenjie Zhang . 2020 . Effective and efficient truss computation over large heterogeneous information networks . In ICDE. 901 - 912 . Yixing Yang, Yixiang Fang, Xuemin Lin, and Wenjie Zhang. 2020. Effective and efficient truss computation over large heterogeneous information networks. In ICDE. 901-912.","journal-title":"ICDE."},{"key":"e_1_3_2_2_30_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_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Zhiwei Zhang Xin Huang Jianliang Xu Byron Choi and Zechao Shang. 2019. Keyword-Centric Community Search. In ICDE. 422--433.  Zhiwei Zhang Xin Huang Jianliang Xu Byron Choi and Zechao Shang. 2019. Keyword-Centric Community Search. In ICDE. 422--433.","DOI":"10.1109\/ICDE.2019.00045"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687709"},{"key":"e_1_3_2_2_33_1","volume-title":"Querying Cohesive Subgraphs by Keywords","author":"Zhu Yuanyuan","unstructured":"Yuanyuan Zhu , Qian Zhang , Lu Qin , Lijun Chang , and Jeffrey Xu Yu. 2018. Querying Cohesive Subgraphs by Keywords . In ICDE. IEEE Computer Society , 1324--1327. Yuanyuan Zhu, Qian Zhang, Lu Qin, Lijun Chang, and Jeffrey Xu Yu. 2018. Querying Cohesive Subgraphs by Keywords. In ICDE. IEEE Computer Society, 1324--1327."}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Ireland","acronym":"CIKM '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412006","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:28Z","timestamp":1750197748000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":32,"alternative-id":["10.1145\/3340531.3412006","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412006","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}