{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:25:00Z","timestamp":1740108300961,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T00:00:00Z","timestamp":1478217600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P2-0041, J2-6764"],"award-info":[{"award-number":["P2-0041, J2-6764"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00607-016-0524-7","type":"journal-article","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T03:32:16Z","timestamp":1478230336000},"page":"679-700","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Community detection in networks using new update rules for label propagation"],"prefix":"10.1007","volume":"99","author":[{"given":"Krista Rizman","family":"\u017dalik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,4]]},"reference":[{"key":"524_CR1","unstructured":"Porter MA, Onnela J-P, Mucha PJ (2009) Communities in networks. Not Am Math Soc 56:1082\u20131097, 1164\u20131166"},{"key":"524_CR2","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz SH (2001) Exploring complex networks. Nature 410:268\u2013276","journal-title":"Nature"},{"key":"524_CR3","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.knosys.2011.06.014","volume":"26","author":"Z Xia","year":"2012","unstructured":"Xia Z, Bu Z (2012) Community detection based on a semantic network. Knowl Based Syst 26:30\u201339","journal-title":"Knowl Based Syst"},{"key":"524_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486:75","journal-title":"Phys Rep"},{"key":"524_CR5","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435:814\u2013818","journal-title":"Nature"},{"issue":"9","key":"524_CR6","doi-asserted-by":"crossref","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F Radicchi","year":"2004","unstructured":"Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying clusters in networks. Proc Natl Acad Sci USA 101(9):2658\u20132663","journal-title":"Proc Natl Acad Sci USA"},{"key":"524_CR7","doi-asserted-by":"crossref","first-page":"046108","DOI":"10.1103\/PhysRevE.72.046108","volume":"72","author":"J Bagrow","year":"2005","unstructured":"Bagrow J, Bolt E (2005) A local method for detecting communities. Phys Rev E 72:046108","journal-title":"Phys Rev E"},{"key":"524_CR8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1140\/epjb\/e2004-00125-x","volume":"38","author":"F Wu","year":"2004","unstructured":"Wu F, Huberman B (2004) Finding communities in linear time: a physics approach. Eur Phys J B 38:331\u2013338","journal-title":"Eur Phys J B"},{"key":"524_CR9","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.79.066111","volume":"79","author":"AD Medus","year":"2009","unstructured":"Medus AD, Dorso CO (2009) Alternative approach to community detection in networks. Phys Rev E 79:066111","journal-title":"Phys Rev E"},{"key":"524_CR10","doi-asserted-by":"crossref","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 USA 99:7821\u20137826","journal-title":"Proc Natl Acad Sci USA"},{"issue":"6","key":"524_CR11","doi-asserted-by":"crossref","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(6):066111","journal-title":"Phys Rev E"},{"key":"524_CR12","doi-asserted-by":"crossref","unstructured":"Rosvall M, Bergstrom CT (2007) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA 105:1118\u20131123","DOI":"10.1073\/pnas.0706851105"},{"key":"524_CR13","doi-asserted-by":"crossref","first-page":"046114","DOI":"10.1103\/PhysRevE.81.046114","volume":"81","author":"P Ronhovde","year":"2010","unstructured":"Ronhovde P, Nussinov Z (2010) Local resolution-limit-free Potts model for community detection. Phys Rev E 81:046114","journal-title":"Phys Rev E"},{"key":"524_CR14","doi-asserted-by":"crossref","first-page":"036103","DOI":"10.1103\/PhysRevE.84.036103","volume":"84","author":"B Ball","year":"2011","unstructured":"Ball B, Karrer B, Newman MEJ (2011) Efficient and principled method for detecting communities in networks. Phys Rev E 84:036103","journal-title":"Phys Rev E"},{"key":"524_CR15","doi-asserted-by":"crossref","unstructured":"Rizman \u017dalik K, \u017dalik B (2014) A local multiresolution algorithm for detecting communities of unbalanced structures. Phys A Stat Mech Appl 407:380\u2013393","DOI":"10.1016\/j.physa.2014.03.059"},{"issue":"3","key":"524_CR16","doi-asserted-by":"crossref","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 communities in large-scale networks. Phys Rev E 76(3):036106","journal-title":"Phys Rev E"},{"key":"524_CR17","doi-asserted-by":"crossref","first-page":"026129","DOI":"10.1103\/PhysRevE.80.026129","volume":"80","author":"MJ Barber","year":"2009","unstructured":"Barber MJ, Clark JW (2009) Detecting network communities by propagating labels under constraints. Phys Rev E 80:026129","journal-title":"Phys Rev E"},{"issue":"7","key":"524_CR18","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1016\/j.physa.2009.12.019","volume":"389","author":"X Liu","year":"2010","unstructured":"Liu X, Murata T (2010) Advanced modularity-specialized label propagation algorithm for detecting communities in networks. Phys A Stat Mech Appl 389(7):1493\u20131500","journal-title":"Phys A Stat Mech Appl"},{"key":"524_CR19","doi-asserted-by":"crossref","first-page":"046112","DOI":"10.1103\/PhysRevE.77.046112","volume":"77","author":"P Schuetz","year":"2008","unstructured":"Schuetz P, Caflisch A (2008) Efficient modularity optimization by multistep greedy algorithm and node refinement. Phys Rev E 77:046112","journal-title":"Phys Rev E"},{"key":"524_CR20","doi-asserted-by":"crossref","unstructured":"Lancichinetti A, Fortunato S (2012) Consensus clustering in complex networks. Scientific Reports 2. Article number: 336","DOI":"10.1038\/srep00336"},{"key":"524_CR21","unstructured":"This data are from Add Health, a program project by Udry J., Bearman S., Harris, Kathleen Mullan, and funded by a grant P01-HD31921 from the National Institute of Child Health and Human Development, Persons interested in obtaining data files from Add Health should contact Add Health, Carolina Population Center, (addhealth@unc.edu)"},{"key":"524_CR22","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452\u2013473","journal-title":"J Anthropol Res"},{"key":"524_CR23","doi-asserted-by":"crossref","unstructured":"Arenas A, D\u00edaz-Guilera A, P\u00e9rez-Vicente CJ (2006) Synchronization reveals topological scales in complex networks. Phys Rev Lett 96:114102","DOI":"10.1103\/PhysRevLett.96.114102"},{"issue":"4","key":"524_CR24","doi-asserted-by":"crossref","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":"524_CR25","doi-asserted-by":"publisher","unstructured":"Danon L, Diaz-Guilera A, Duch J, Arenas A (2005) Comparing Community Structure Identification. J Stat Mech Theor Exp 2005(9). Article ID: P09008. doi:\n                        10.1088\/1742-5468\/2005\/09\/p0900","DOI":"10.1088\/1742-5468\/2005\/09\/p0900"},{"key":"524_CR26","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54:396\u2013405","journal-title":"Behav Ecol Sociobiol"},{"key":"524_CR27","volume-title":"The stanford graphbase: a platform for combinatorial computing","author":"DE Knuth","year":"1993","unstructured":"Knuth DE (1993) The stanford graphbase: a platform for combinatorial computing. Addison-Wesley, Reading"},{"key":"524_CR28","doi-asserted-by":"crossref","unstructured":"Zardi H, Ben Romdhane L, MARS (Modeling of Automated Reasoning Systems) Research Group (2013) An O(n2) algorithm for detecting communities of unbalanced sizes in large scale social networks. Knowl Based Syst 37:19\u201336","DOI":"10.1016\/j.knosys.2012.05.021"},{"key":"524_CR29","unstructured":"Ding C, Xiaofeng H (2001) Spectral min max cut for graph partitioning and data clustering, PhD thesis, California University"},{"key":"524_CR30","unstructured":"Brandes U, Gaertler M (2003) Experiments on graph clustering algorithms, in 11. European Symposium on Algorithms, pp. 568\u2013579"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-016-0524-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-016-0524-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-016-0524-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T02:35:30Z","timestamp":1497321330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-016-0524-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,4]]},"references-count":30,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["524"],"URL":"https:\/\/doi.org\/10.1007\/s00607-016-0524-7","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2016,11,4]]}}}