{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T21:27:05Z","timestamp":1774906025870,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T00:00:00Z","timestamp":1527724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10115-018-1209-7","type":"journal-article","created":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T06:14:11Z","timestamp":1527747251000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Fast detection of community structures using graph traversal in social networks"],"prefix":"10.1007","volume":"59","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1669-6594","authenticated-orcid":false,"given":"Partha","family":"Basuchowdhuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyaki","family":"Sikdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Varsha","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khusbu","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Surabhi","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhashis","family":"Majumder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,31]]},"reference":[{"key":"1209_CR1","doi-asserted-by":"publisher","unstructured":"Ankerst M, Breunig MM, Kriegel HP, Sander J (1999) Optics: ordering points to identify the clustering structure. ACM SIGMOD Rec 28(2):49\u201360. ISSN 0163-5808. https:\/\/doi.org\/10.1145\/304181.304187 . http:\/\/portal.acm.org\/citation.cfm?id=304187","DOI":"10.1145\/304181.304187"},{"key":"1209_CR2","doi-asserted-by":"publisher","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Mech ELJS (2008) Fast unfolding of communities in large networks. J Stat Mech https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"1209_CR3","unstructured":"Brandes U, Delling D, Gaertler M, Goerke R, Hoefer M, Nikoloski Z, Wagner D (2006) Maximizing modularity is hard. http:\/\/arxiv.org\/abs\/physics\/0608255"},{"key":"1209_CR4","doi-asserted-by":"crossref","unstructured":"Chen J, Zaiane OR, Goebel R (2009) A visual data mining approach to find overlapping communities in networks. In: Memon N, Alhajj R (eds) ASONAM. IEEE Computer Society, pp 338\u2013343. ISBN 978-0-7695-3689-7. http:\/\/dblp.uni-trier.de\/db\/conf\/asunam\/asunam2009.html#ChenZG09a","DOI":"10.1109\/ASONAM.2009.15"},{"key":"1209_CR5","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111","journal-title":"Phys Rev E"},{"key":"1209_CR6","doi-asserted-by":"crossref","unstructured":"Creusefond J, Largillier T, Peyronnet S (2017) A lexdfs-based approach on finding compact communities. In: Kaya M, Erdo\u01e7an \u00d6, Rokne J (eds) From social data mining and analysis to prediction and community detection. Springer, Berlin, pp 141\u2013177","DOI":"10.1007\/978-3-319-51367-6_7"},{"key":"1209_CR7","doi-asserted-by":"crossref","unstructured":"Cui W, Xiao Y, Wang H, Wang W (2014) Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data. ACM, pp 991\u20131002","DOI":"10.1145\/2588555.2612179"},{"key":"1209_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","volume":"659","author":"S Fortunato","year":"2016","unstructured":"Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659:1\u201344","journal-title":"Phys Rep"},{"issue":"12","key":"1209_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 (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"1209_CR10","doi-asserted-by":"publisher","first-page":"046106","DOI":"10.1103\/PhysRevE.81.046106","volume":"81","author":"BH Good","year":"2010","unstructured":"Good BH, De Montjoye YA, Clauset A (2010) Performance of modularity maximization in practical contexts. Phys Rev E 81(4):046106","journal-title":"Phys Rev E"},{"issue":"78","key":"1209_CR11","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"MS Granovetter","year":"1973","unstructured":"Granovetter MS (1973) The strength of weak ties. Am J Sociol 78(78):1360\u20131380","journal-title":"Am J Sociol"},{"key":"1209_CR12","doi-asserted-by":"crossref","unstructured":"Gregory S (2008) A fast algorithm to find overlapping communities in networks. In: Daelemans W, Goethals B, Morik K (eds) ECML\/PKDD (1), volume 5211 of lecture notes in computer science. Springer, Berlin, pp 408\u2013423. ISBN 978-3-540-87478-2","DOI":"10.1007\/978-3-540-87479-9_45"},{"key":"1209_CR13","unstructured":"Klimt B, Yang Y (2004) Introducing the enron corpus. In: First conference on email and anti-spam (CEAS) proceedings"},{"issue":"4","key":"1209_CR14","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110","journal-title":"Phys Rev E"},{"key":"1209_CR15","doi-asserted-by":"publisher","unstructured":"Leskovec J, Kleinberg JM, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. TKDD. https:\/\/doi.org\/10.1145\/1217299.1217301","DOI":"10.1145\/1217299.1217301"},{"key":"1209_CR16","doi-asserted-by":"publisher","unstructured":"Lin C, Ishwar P, Ding W (2017) Node embedding for network community discovery. In: 2017 IEEE international conference on acoustics, speech and signal processing (ICASSP), pp 4129\u20134133. https:\/\/doi.org\/10.1109\/ICASSP.2017.7952933","DOI":"10.1109\/ICASSP.2017.7952933"},{"key":"1209_CR17","doi-asserted-by":"publisher","first-page":"S477","DOI":"10.1098\/rsbl.2004.0225","volume":"271","author":"D Lusseau","year":"2004","unstructured":"Lusseau D, Newman MEJ (2004) Identifying the role that animals play in their social networks. Proc R Soc Lond Ser B Biol Sci 271:S477\u2013S481","journal-title":"Proc R Soc Lond Ser B Biol Sci"},{"issue":"1","key":"1209_CR18","doi-asserted-by":"publisher","first-page":"8","DOI":"10.3390\/a9010008","volume":"9","author":"N Meghanathan","year":"2016","unstructured":"Meghanathan N (2016) A greedy algorithm for neighborhood overlap-based community detection. Algorithms 9(1):8","journal-title":"Algorithms"},{"key":"1209_CR19","doi-asserted-by":"publisher","first-page":"016107","DOI":"10.1103\/PhysRevE.77.016107","volume":"77","author":"T Nepusz","year":"2007","unstructured":"Nepusz T, Petroczi A, Negyessy L, Bazso F (2007) Fuzzy communities and the concept of bridgeness in complex networks. Phys Rev E 77:016107","journal-title":"Phys Rev E"},{"key":"1209_CR20","doi-asserted-by":"publisher","unstructured":"Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69:066133. https:\/\/doi.org\/10.1103\/PhysRevE.69.066133","DOI":"10.1103\/PhysRevE.69.066133"},{"issue":"23","key":"1209_CR21","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582","journal-title":"Proc Natl Acad Sci"},{"issue":"03","key":"1209_CR22","doi-asserted-by":"publisher","first-page":"P03024","DOI":"10.1088\/1742-5468\/2009\/03\/P03024","volume":"2009","author":"V Nicosia","year":"2009","unstructured":"Nicosia V, Mangioni G, Carchiolo V, Malgeri M (2009) Extending the definition of modularity to directed graphs with overlapping communities. J Stat Mech Theory Exp 2009(03):P03024","journal-title":"J Stat Mech Theory Exp"},{"key":"1209_CR23","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76:036106. https:\/\/doi.org\/10.1103\/PhysRevE.76.036106","journal-title":"Phys Rev E"},{"key":"1209_CR24","doi-asserted-by":"crossref","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA 1118","DOI":"10.1073\/pnas.0706851105"},{"key":"1209_CR25","doi-asserted-by":"crossref","unstructured":"Shen HW, Cheng XQ, Guo JF (2009) Quantifying and identifying the overlapping community structure in networks. J Stat Mech Theory Exp 2009(07):P07042. http:\/\/stacks.iop.org\/1742-5468\/2009\/i=07\/a=P07042","DOI":"10.1088\/1742-5468\/2009\/07\/P07042"},{"key":"1209_CR26","doi-asserted-by":"crossref","unstructured":"Wang X, Cui P, Wang J, Pei J, Zhu W, Yang S (2017) Community preserving network embedding. In: AAAI, pp 203\u2013209","DOI":"10.1609\/aaai.v31i1.10488"},{"key":"1209_CR27","doi-asserted-by":"publisher","unstructured":"Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, KDD\u201910. ACM, New York, NY, USA, pp 1039\u20131048. ISBN: 978-1-4503-0055-1. https:\/\/doi.org\/10.1145\/1835804.1835935","DOI":"10.1145\/1835804.1835935"},{"key":"1209_CR28","doi-asserted-by":"publisher","unstructured":"Whang JJ, Gleich DF, Dhillon IS (2013) Overlapping community detection using seed set expansion. In: Proceedings of the 22nd ACM international conference on information & knowledge management, CIKM\u201913. ACM, New York, NY, USA, pp 2099\u20132108. ISBN: 978-1-4503-2263-8. https:\/\/doi.org\/10.1145\/2505515.2505535","DOI":"10.1145\/2505515.2505535"},{"key":"1209_CR29","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/j.physa.2015.09.093","volume":"443","author":"J Xiang","year":"2016","unstructured":"Xiang J, Tao H, Zhang Y, Ke H, Li J-M, Xiao-Ke X, Liu C-C, Chen S (2016) Local modularity for community detection in complex networks. Phys A Stat Mech Its Appl 443:451\u2013459","journal-title":"Phys A Stat Mech Its Appl"},{"key":"1209_CR30","unstructured":"Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. In: Zaki MJ, Siebes A, Yu JX, Goethals B, Webb GI, Wu X (eds) ICDM. IEEE Computer Society, pp 745\u2013754. ISBN: 978-1-4673-4649-8. http:\/\/dblp.uni-trier.de\/db\/conf\/icdm\/icdm2012.html#YangL12"},{"key":"1209_CR31","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"W Zachary","year":"1977","unstructured":"Zachary W (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452\u2013473","journal-title":"J Anthropol Res"},{"key":"1209_CR32","unstructured":"Zheng VW, Cavallari S, Cai H, Chang KC-C, Cambria E (2016) From node embedding to community embedding. arXiv preprint arXiv:1610.09950"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1209-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-018-1209-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1209-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T22:10:09Z","timestamp":1751667009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-018-1209-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,31]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["1209"],"URL":"https:\/\/doi.org\/10.1007\/s10115-018-1209-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,31]]},"assertion":[{"value":"19 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}