{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T01:58:26Z","timestamp":1768528706526,"version":"3.49.0"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001781","name":"Swinburne University of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1016\/j.is.2021.101914","type":"journal-article","created":{"date-parts":[[2021,10,18]],"date-time":"2021-10-18T22:14:27Z","timestamp":1634595267000},"page":"101914","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"special_numbering":"C","title":["Keyword aware influential community search in large attributed graphs"],"prefix":"10.1016","volume":"104","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3725-3493","authenticated-orcid":false,"given":"Md. Saiful","family":"Islam","sequence":"first","affiliation":[]},{"given":"Mohammed Eunus","family":"Ali","sequence":"additional","affiliation":[]},{"given":"Yong-Bin","family":"Kang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9067-5639","authenticated-orcid":false,"given":"Timos","family":"Sellis","sequence":"additional","affiliation":[]},{"given":"Farhana M.","family":"Choudhury","sequence":"additional","affiliation":[]},{"given":"Shamik","family":"Roy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.is.2021.101914_b1","doi-asserted-by":"crossref","unstructured":"Mauro Sozio, Aristides Gionis, The community-search problem and how to plan a successful cocktail party, in: SIGKDD, 2010, pp. 939\u2013948.","DOI":"10.1145\/1835804.1835923"},{"key":"10.1016\/j.is.2021.101914_b2","unstructured":"Laurent Kretz, Virtual online community with geographically targeted advertising, April 17 2008. US Patent App. 11\/580,725."},{"key":"10.1016\/j.is.2021.101914_b3","series-title":"2011 IEEE Congress of Evolutionary Computation, CEC","first-page":"2207","article-title":"Friend recommendations in social networks using genetic algorithms and network topology","author":"Naruchitparames","year":"2011"},{"issue":"12","key":"10.1016\/j.is.2021.101914_b4","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.14778\/2994509.2994538","article-title":"Effective community search for large attributed graphs","volume":"9","author":"Fang","year":"2016","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"10.1016\/j.is.2021.101914_b5","doi-asserted-by":"crossref","first-page":"709","DOI":"10.14778\/3055330.3055337","article-title":"Effective community search over large spatial graphs","volume":"10","author":"Fang","year":"2017","journal-title":"Proc. VLDB Endow."},{"issue":"9","key":"10.1016\/j.is.2021.101914_b6","doi-asserted-by":"crossref","first-page":"949","DOI":"10.14778\/3099622.3099626","article-title":"Attribute-driven community search","volume":"10","author":"Huang","year":"2017","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"10.1016\/j.is.2021.101914_b7","doi-asserted-by":"crossref","first-page":"509","DOI":"10.14778\/2735479.2735484","article-title":"Influential community search in large networks","volume":"8","author":"Li","year":"2015","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.is.2021.101914_b8","unstructured":"Jianxin Li, Xinjue Wang, Ke Deng, Xiaochun Yang, Timos Sellis, Jeffrey\u00a0Xu Yu, Most influential community search over large social networks, in: ICDE, 2017, pp. 871\u2013882."},{"key":"10.1016\/j.is.2021.101914_b9","series-title":"ICDE","first-page":"422","article-title":"Keyword-centric community search","author":"Zhang","year":"2019"},{"key":"10.1016\/j.is.2021.101914_b10","series-title":"ICDE","first-page":"88","article-title":"Contextual community search over large social networks","author":"Chen","year":"2019"},{"issue":"4","key":"10.1016\/j.is.2021.101914_b11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/2043652.2043654","article-title":"Finding maximal cliques in massive networks","volume":"36","author":"Cheng","year":"2011","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.is.2021.101914_b12","doi-asserted-by":"crossref","unstructured":"James Cheng, Yiping Ke, Shumo Chu, M.\u00a0Tamer \u00d6zsu, Efficient core decomposition in massive networks, in: ICDE, 2011, pp. 51\u201362.","DOI":"10.1109\/ICDE.2011.5767911"},{"issue":"9","key":"10.1016\/j.is.2021.101914_b13","doi-asserted-by":"crossref","first-page":"812","DOI":"10.14778\/2311906.2311909","article-title":"Truss decomposition in massive networks","volume":"5","author":"Wang","year":"2012","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"10.1016\/j.is.2021.101914_b14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","author":"Fortunato","year":"2010","journal-title":"Phys. Rep."},{"issue":"1","key":"10.1016\/j.is.2021.101914_b15","doi-asserted-by":"crossref","first-page":"718","DOI":"10.14778\/1687627.1687709","article-title":"Graph clustering based on structural\/attribute similarities","volume":"2","author":"Zhou","year":"2009","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.is.2021.101914_b16","doi-asserted-by":"crossref","unstructured":"Yiye Ruan, David Fuhry, Srinivasan Parthasarathy, Efficient community detection in large networks using content and links, in: WWW, 2013, pp. 1089\u20131098.","DOI":"10.1145\/2488388.2488483"},{"issue":"9","key":"10.1016\/j.is.2021.101914_b17","doi-asserted-by":"crossref","first-page":"2182","DOI":"10.1016\/j.physa.2012.12.013","article-title":"An efficient community detection method based on rank centrality","volume":"392","author":"Jiang","year":"2013","journal-title":"Physica A"},{"key":"10.1016\/j.is.2021.101914_b18","series-title":"SIGMOD","first-page":"505","article-title":"A model-based approach to attributed graph clustering","author":"Xu","year":"2012"},{"key":"10.1016\/j.is.2021.101914_b19","doi-asserted-by":"crossref","unstructured":"Yan Liu, Alexandru Niculescu-Mizil, Wojciech Gryc, Topic-link LDA: Joint models of topic and author community, in: ICML, 2009, pp. 665\u2013672.","DOI":"10.1145\/1553374.1553460"},{"key":"10.1016\/j.is.2021.101914_b20","series-title":"WWW","first-page":"331","article-title":"Using content and interactions for discovering communities in social networks","author":"Sachan","year":"2012"},{"key":"10.1016\/j.is.2021.101914_b21","series-title":"CIKM","first-page":"1553","article-title":"Efficient computation of importance based communities in web-scale networks using a single machine","author":"Chen","year":"2016"},{"issue":"9","key":"10.1016\/j.is.2021.101914_b22","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.14778\/3213880.3213881","article-title":"An optimal and progressive approach to online search of top-k influential communities","volume":"11","author":"Bi","year":"2018","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.is.2021.101914_b23","series-title":"2017 IEEE 11th International Conference on Semantic Computing, ICSC","first-page":"156","article-title":"Querying intimate-core groups in weighted graphs","author":"Zheng","year":"2017"},{"key":"10.1016\/j.is.2021.101914_b24","article-title":"Exploring communities in large profiled graphs","author":"Chen","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"10.1016\/j.is.2021.101914_b25","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1186\/s40537-019-0243-y","article-title":"Advancing community detection using keyword attribute search","volume":"6","author":"Chobe","year":"2019","journal-title":"J. Big Data"},{"key":"10.1016\/j.is.2021.101914_b26","article-title":"Compact group discovery in attributed graphs and social networks","author":"Khan","year":"2019","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/j.is.2021.101914_b27","series-title":"SIGMOD","first-page":"457","article-title":"Skyline community search in multi-valued networks","author":"Li","year":"2018"},{"key":"10.1016\/j.is.2021.101914_b28","article-title":"A survey of community search over big graphs","author":"Fang","year":"2019","journal-title":"VLDB J."},{"key":"10.1016\/j.is.2021.101914_b29","series-title":"Efficient estimation of word representations in vector space","author":"Mikolov","year":"2013"},{"key":"10.1016\/j.is.2021.101914_b30","series-title":"Python 3 Text Processing with NLTK 3 Cookbook","author":"Perkins","year":"2014"},{"key":"10.1016\/j.is.2021.101914_b31","first-page":"58","article-title":"Document clustering using concept space and cosine similarity measurement","volume":"vol. 1","author":"Muflikhah","year":"2009"},{"key":"10.1016\/j.is.2021.101914_b32","series-title":"An O (m) algorithm for cores decomposition of networks","author":"Batagelj","year":"2003"},{"key":"10.1016\/j.is.2021.101914_b33","series-title":"Spacy-industrial-strength natural language processing in Python","author":"AI\u00a0Explosion","year":"2017"},{"key":"10.1016\/j.is.2021.101914_b34","first-page":"1089","article-title":"An intrinsic information content metric for semantic similarity in WordNet","volume":"vol. 16","author":"Seco","year":"2004"},{"key":"10.1016\/j.is.2021.101914_b35","unstructured":"Yining Wang, Liwei Wang, Yuanzhi Li, Di He, Tie-Yan Liu, A theoretical analysis of NDCG type ranking measures, in: Conference on Learning Theory, 2013, pp. 25\u201354."},{"issue":"2","key":"10.1016\/j.is.2021.101914_b36","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","article-title":"A cluster separation measure","author":"Davies","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.is.2021.101914_b37","doi-asserted-by":"crossref","unstructured":"Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zhang, Zhong Su, Arnetminer: Extraction and mining of academic social networks, in: SIGKDD, 2008, pp. 990\u2013998.","DOI":"10.1145\/1401890.1402008"},{"issue":"5","key":"10.1016\/j.is.2021.101914_b38","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1007\/s10618-015-0422-1","article-title":"Efficient and effective community search","volume":"29","author":"Barbieri","year":"2015","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.is.2021.101914_b39","doi-asserted-by":"crossref","unstructured":"Wanyun Cui, Yanghua Xiao, Haixun Wang, Wei Wang, Local search of communities in large graphs, in: SIGMOD, 2014, pp. 991\u20131002.","DOI":"10.1145\/2588555.2612179"},{"key":"10.1016\/j.is.2021.101914_b40","doi-asserted-by":"crossref","unstructured":"Xin Huang, Hong Cheng, Lu Qin, Wentao Tian, Jeffrey\u00a0Xu Yu, Querying k-truss community in large and dynamic graphs, in: SIGMOD, 2014, pp. 1311\u20131322.","DOI":"10.1145\/2588555.2610495"},{"key":"10.1016\/j.is.2021.101914_b41","series-title":"ICDE","first-page":"797","article-title":"Persistent community search in temporal networks","author":"Li","year":"2018"},{"key":"10.1016\/j.is.2021.101914_b42","series-title":"ICDE","first-page":"233","article-title":"Efficient computing of radius-bounded k-cores","author":"Wang","year":"2018"},{"issue":"6","key":"10.1016\/j.is.2021.101914_b43","doi-asserted-by":"crossref","first-page":"397","DOI":"10.14778\/1978665.1978671","article-title":"On social-temporal group query with acquaintance constraint","volume":"4","author":"Yang","year":"2011","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"10.1016\/j.is.2021.101914_b44","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/TKDE.2017.2783933","article-title":"Index-based densest clique percolation community search in networks","volume":"30","author":"Yuan","year":"2017","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"10.1016\/j.is.2021.101914_b45","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s00778-017-0473-6","article-title":"Geo-social group queries with minimum acquaintance constraints","volume":"26","author":"Zhu","year":"2017","journal-title":"VLDB J."}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437921001216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437921001216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T15:11:14Z","timestamp":1759677074000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437921001216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":45,"alternative-id":["S0306437921001216"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2021.101914","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2022,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Keyword aware influential community search in large attributed graphs","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2021.101914","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"101914"}}