{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T21:37:03Z","timestamp":1773524223322,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T00:00:00Z","timestamp":1567814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T00:00:00Z","timestamp":1567814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000005","name":"U.S. Department of Defense","doi-asserted-by":"publisher","award":["W911NF1810437"],"award-info":[{"award-number":["W911NF1810437"]}],"id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000005","name":"U.S. Department of Defense","doi-asserted-by":"publisher","award":["W911NF1810246"],"award-info":[{"award-number":["W911NF1810246"]}],"id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s40537-019-0243-y","type":"journal-article","created":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T08:03:07Z","timestamp":1567843387000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Advancing community detection using Keyword Attribute Search"],"prefix":"10.1186","volume":"6","author":[{"given":"Sanket","family":"Chobe","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5458-8282","authenticated-orcid":false,"given":"Justin","family":"Zhan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,7]]},"reference":[{"key":"243_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si AL. Statistical mechanics of complex networks. Rev Mod Phys. 2002;74:47\u201397.","journal-title":"Rev Mod Phys"},{"key":"243_CR2","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.physa.2016.12.014","volume":"471","author":"PG Sun","year":"2017","unstructured":"Sun PG, Sun X. Complete graph model for community detection. Phys A Stat Mech Appl. 2017;471:88\u201397.","journal-title":"Phys A Stat Mech Appl"},{"key":"243_CR3","doi-asserted-by":"publisher","first-page":"7327","DOI":"10.1073\/pnas.0611034104","volume":"104","author":"M Rosvall","year":"2007","unstructured":"Rosvall M, Bergstrom CT. An information-theoretic framework for resolving community structure in complex networks. Proc Natl Acad Sci. 2007;104:7327\u201331.","journal-title":"Proc Natl Acad Sci"},{"key":"243_CR4","doi-asserted-by":"publisher","first-page":"36106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S. Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E. 2007;76:36106.","journal-title":"Phys Rev E"},{"key":"243_CR5","unstructured":"Aldous D, Fill J. Reversible Markov chains and random walks on graphs; 2002. \n                    http:\/\/www.stat.berkeley.edu\/users\/aldous\/RWG\/book.html\n                    \n                  ."},{"key":"243_CR6","doi-asserted-by":"publisher","first-page":"38002","DOI":"10.1209\/0295-5075\/87\/38002","volume":"87","author":"XS Zhang","year":"2009","unstructured":"Zhang XS, Wang RS, Wang Y, Wang J, Qiu Y, Wang L, et al. Modularity optimization in community detection of complex networks. Epl. 2009;87:38002.","journal-title":"Epl"},{"key":"243_CR7","first-page":"490","volume-title":"Computational complexity theory","author":"S Fortunato","year":"2012","unstructured":"Fortunato S, Castellano C. Community structure in graphs. In: Meyers RA, editor. Computational complexity theory. New York: Springer; 2012. p. 490\u2013512."},{"key":"243_CR8","doi-asserted-by":"crossref","unstructured":"Sachan M, Contractor D, Faruquie TA, Subramaniam LV. Using content and interactions for discovering communities in social networks. In: Proceedings of the 21st internarional confernce on world wide web\u2014WWW \u201912. New York: ACM; 2012. p. 331. \n                    http:\/\/dl.acm.org\/citation.cfm?doid=2187836.2187882\n                    \n                  .","DOI":"10.1145\/2187836.2187882"},{"key":"243_CR9","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ. Community structure in social and biological networks. Proc Natl Acad Sci USA. 2002;99:7821\u20136.","journal-title":"Proc Natl Acad Sci USA"},{"key":"243_CR10","doi-asserted-by":"crossref","unstructured":"Nallapati RM, Ahmed A, Xing EP, Cohen WW. Joint latent topic models for text and citations. In: Proceeding 14th ACM SIGKDD international conference knowledge discovery data Min\u2014KDD 08. New York: ACM; 2008. p. 542.","DOI":"10.1145\/1401890.1401957"},{"key":"243_CR11","doi-asserted-by":"crossref","unstructured":"Liu Y, Niculescu-Mizil A, Gryc W. Topic-link LDA. In: Proceedings of the 26th annual international conference on machine learning. New York: ACM; 2009. p. 1\u20138.","DOI":"10.1145\/1553374.1553460"},{"key":"243_CR12","doi-asserted-by":"publisher","first-page":"26113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M Newman","year":"2004","unstructured":"Newman M, Girvan M. Finding and evaluating community structure in networks. Phys Rev E. 2004;69:26113.","journal-title":"Phys Rev E"},{"key":"243_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2006","unstructured":"Fortunato S, Barthelemy M. Resolution limit in community detection. Proc Natl Acad Sci. 2006;104:36\u201341.","journal-title":"Proc Natl Acad Sci"},{"key":"243_CR14","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1109\/TKDE.2016.2563425","volume":"28","author":"HJ Li","year":"2016","unstructured":"Li HJ, Bu Z, Li A, Liu Z, Shi Y. Fast and accurate mining the community structure: integrating center locating and membership optimization. IEEE Trans Knowl Data Eng. 2016;28:2349\u201362.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"243_CR15","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Gallagher B, Eliassi-Rad T. Fast best-effort pattern matching in large attributed graphs. In: Proceedigns of the 13th ACM SIGKDD intenational conference on knowledge discovery data minning\u2014KDD \u201907. New York: ACM; 2007. p. 737.","DOI":"10.1145\/1281192.1281271"},{"key":"243_CR16","doi-asserted-by":"crossref","unstructured":"Fang Y, Cheng R, Luo S, Hu J. Effective community search for large attributed graphs. In: Proceedings of the VLDB endow. VLDB Endowment; 2016. p. 1233\u201344.","DOI":"10.14778\/2994509.2994538"},{"key":"243_CR17","doi-asserted-by":"crossref","unstructured":"Zhou Y, Cheng H, Yu JX. Graph clustering based on structural\/attribute similarities. In: Proceedings of the VLDB endow. VLDB Endowment; 2014. p. 718\u201329.","DOI":"10.14778\/1687627.1687709"},{"key":"243_CR18","unstructured":"Ruan Y, Fuhry D, Parthasarathy S. Efficient community detection in large networks using content and links. In: Proceedings of the 22nd international conference on world Wide Web\u2014WWW \u201913. New York: ACM; 2016. p. 1089\u201398."},{"key":"243_CR19","doi-asserted-by":"crossref","unstructured":"Xu Z, Ke Y, Wang Y, Cheng H, Cheng J. A model-based approach to attributed graph clustering. In; Proceedings of the 2012 international conference on management of data\u2014SIGMOD \u201912. New York: ACM; 2012. p. 505.","DOI":"10.1145\/2213836.2213894"},{"key":"243_CR20","doi-asserted-by":"crossref","unstructured":"Yang J, McAuley J, Leskovec J. Community detection in networks with node attributes. In: Proceedings of the IEEE international conference data mining. Nwe York: ICDM; 2013. p. 1151\u20136.","DOI":"10.1109\/ICDM.2013.167"},{"key":"243_CR21","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1109\/TCYB.2017.2693558","volume":"48","author":"T He","year":"2018","unstructured":"He T, Chan KCC. MISAGA: an algorithm for mining interesting subgraphs in attributed graphs. IEEE Trans Cybern. 2018;48:1369\u201382.","journal-title":"IEEE Trans Cybern"},{"key":"243_CR22","volume-title":"Encyclopedia of social network analysis and mining","author":"T Yang","year":"2017","unstructured":"Yang T, Jin R, Chi Y, Zhu S. Combining link and content for community detection. In: Alhajj R, Rokne J, editors. Encyclopedia of social network analysis and mining. New York: Springer; 2017."},{"key":"243_CR23","doi-asserted-by":"crossref","unstructured":"Sozio M, Gionis A. The community-search problem and how to plan a successful cocktail party. In: Proceedings 16th ACM SIGKDD international conference on knowldge discovery data minning\u2014KDD \u201910. New York: ACM; 2010. p. 939.","DOI":"10.1145\/1835804.1835923"},{"key":"243_CR24","unstructured":"Xiao Y, Lu Y, Cui W, Wang W, Wang H. Online search of overlapping communities. In: Proceedings of the 2013 international conference on management data\u2014SIGMOD \u201913. New York: ACM; 2013. p. 277."},{"key":"243_CR25","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Wang W, Local search of communities in large graphs. In: Proceedings of the ACM SIGMOD international conference on management data\u2014SIGMOD \u201914. New York: ACM; 2014. p. 991\u20131002.","DOI":"10.1145\/2588555.2612179"},{"key":"243_CR26","doi-asserted-by":"crossref","unstructured":"Li R-H, Qin L, Yu JX, Mao R. Influential community search in large networks. In: Proceedings of the VLDB endow. VLDB Endowment; 2015. p. 509\u201320. \n                    http:\/\/www.vldb.org\/pvldb\/vol8\/p509-li.pdf\n                    \n                  .","DOI":"10.14778\/2735479.2735484"},{"key":"243_CR27","doi-asserted-by":"crossref","unstructured":"Yu JX, Huang X, Qin L, Cheng H, Tian W, Querying k-truss community in large and dynamic graphs. In: Proceedings of the ACM SIGMOD international conference on management data\u2014SIGMOD \u201914. New York: ACM; 2014. p. 1311\u201322.","DOI":"10.1145\/2588555.2610495"},{"key":"243_CR28","unstructured":"Bhalotia G, Hulgeri A, Nakhe C, Chakrabarti S, Sudarshan S. Keyword searching and browsing in databases using BANKS. In: Proceedings of the international confernece on data engineering; 2002. p. 431\u201340."},{"key":"243_CR29","unstructured":"Kacholia V, Pandit S, Chakrabarti S, Sudarshan S, Desai R, Karambelkar H. Bidirectional expansion for keyword search on graph databases. Vldb. VLDB Endowment; 2005. p. 505\u201316. \n                    http:\/\/dl.acm.org\/citation.cfm?id=1083592.1083652"},{"key":"243_CR30","doi-asserted-by":"crossref","unstructured":"Ding B, Yu JX, Wang S, Qin L, Zhang X, Lin X. Finding top-k min-cost connected trees in databases. In: Proceedings of the international conference on data engineering; 2007. p. 836\u201345.","DOI":"10.1109\/ICDE.2007.367929"},{"key":"243_CR31","doi-asserted-by":"crossref","unstructured":"Kargar M, An A. Keyword search in graphs. In: Proceedings of the VLDB endow. VLDB Endowment; 2014. p. 681\u201392.","DOI":"10.14778\/2021017.2021025"},{"key":"243_CR32","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1109\/TKDE.2017.2656079","volume":"29","author":"X Lian","year":"2017","unstructured":"Lian X, Chen L, Sun Y, Wang G, Yu JX, Yuan Y. keyword search over distributed graphs with compressed signature. IEEE Trans Knowl Data Eng. 2017;29:1212\u201325.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"243_CR33","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB. Network structure and minimum degree. Soc Netw. 1983;5:269\u201387.","journal-title":"Soc Netw"},{"key":"243_CR34","doi-asserted-by":"publisher","first-page":"40601","DOI":"10.1103\/PhysRevLett.96.040601","volume":"96","author":"SN Dorogovtsev","year":"2005","unstructured":"Dorogovtsev SN, Goltsev AV, Mendes JFF. K-core organization of complex networks. Phys Rev Lett. 2005;96:40601.","journal-title":"Phys Rev Lett"},{"key":"243_CR35","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1109\/TKDE.2013.158","volume":"26","author":"RH Li","year":"2014","unstructured":"Li RH, Yu JX, Mao R. Efficient core maintenance in large dynamic graphs. IEEE Trans Knowl Data Eng. 2014;26:2453\u201365.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"243_CR36","unstructured":"Wu L, Bai T, Zhe W, Wang L, Hu Y, Ji J. A new community detection algorithm based on distance centrality. In: Proceedings of the 2013, 10th international conference on fuzzy system knowledge discovery FSKD 2013; 2013. p. 898\u2013902."},{"key":"243_CR37","doi-asserted-by":"crossref","unstructured":"Hutair MB, Aghbari Z Al, Kamel I. Social community detection based on node distance and interest. In: Proceedings of the 3rd IEEE\/ACM international conference big data computing, application technologies\u2014BDCAT \u201916; 2016. p. 274\u201389.","DOI":"10.1145\/3006299.3006342"},{"key":"243_CR38","unstructured":"Leskovec J, Krevl A. SNAP datasets: stanford large network dataset collection; 2014. \n                    https:\/\/snap.stanford.edu\/data\/wiki-Vote.html\n                    \n                  ."},{"key":"243_CR39","doi-asserted-by":"crossref","unstructured":"Cheng X, Dale C, Liu J. Statistics and social network of YouTube videos. In: IEEE International workshop on Quality of Service IWQoS; 2008. p. 229\u201338.","DOI":"10.1109\/IWQOS.2008.32"},{"key":"243_CR40","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, Moon S. What is Twitter, a social network or a news media? In: WWW \u201910 proceedings of the 19th international conference world wide web. New York: ACM; 2010. p. 591.","DOI":"10.1145\/1772690.1772751"},{"key":"243_CR41","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.socnet.2016.10.004","volume":"51","author":"A Gutfraind","year":"2017","unstructured":"Gutfraind A, Genkin M. A graph database framework for covert network analysis: an application to the Islamic State network in Europe. Soc Netw. 2017;51:178\u201388.","journal-title":"Soc Netw"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-019-0243-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s40537-019-0243-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-019-0243-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,5]],"date-time":"2020-09-05T23:10:44Z","timestamp":1599347444000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-019-0243-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,7]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["243"],"URL":"https:\/\/doi.org\/10.1186\/s40537-019-0243-y","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,7]]},"assertion":[{"value":"27 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"83"}}