{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:47:46Z","timestamp":1765486066518,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1186\/s40537-016-0060-5","type":"journal-article","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T20:36:00Z","timestamp":1480538160000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Limited random walk algorithm for big graph data clustering"],"prefix":"10.1186","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8229-852X","authenticated-orcid":false,"given":"Honglei","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jenni","family":"Raitoharju","sequence":"additional","affiliation":[]},{"given":"Serkan","family":"Kiranyaz","sequence":"additional","affiliation":[]},{"given":"Moncef","family":"Gabbouj","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"issue":"6295","key":"60_CR1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1126\/science.aad9029","volume":"353","author":"AR Benson","year":"2016","unstructured":"Benson AR, Gleich DF, Leskovec J. Higher-order organization of complex networks. Science. 2016;353(6295):163\u20136.","journal-title":"Science"},{"issue":"1","key":"60_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer SE. Graph clustering. Comput Sci Rev. 2007;1(1):27\u201364.","journal-title":"Comput Sci Rev"},{"issue":"2","key":"60_CR3","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/TNSE.2015.2391998","volume":"1","author":"R Lambiotte","year":"2014","unstructured":"Lambiotte R, Delvenne JC, Barahona M. Random walks, Markov processes and the multiscale modular organization of complex networks. IEEE Trans Netw Sci Eng. 2014;1(2):76\u201390.","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"2","key":"60_CR4","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1016\/j.patcog.2013.07.023","volume":"47","author":"P He","year":"2014","unstructured":"He P, Xu X, Hu K, Chen L. Semi-supervised clustering via multi-level random walk. Pattern Recognit. 2014;47(2):820\u201332.","journal-title":"Pattern Recognit"},{"issue":"6","key":"60_CR5","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME. Fast algorithm for detecting community structure in networks. Phys Rev E. 2004;69(6):066133.","journal-title":"Phys Rev E"},{"issue":"10","key":"60_CR6","doi-asserted-by":"crossref","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. J Stat Mech Theory Exp. 2008;2008(10):10008.","journal-title":"J Stat Mech Theory Exp"},{"issue":"6","key":"60_CR7","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C. Finding community structure in very large networks. Phys Rev E. 2004;70(6):066111.","journal-title":"Phys Rev E"},{"issue":"11","key":"60_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1140\/epjb\/e2013-40829-0","volume":"86","author":"L Waltman","year":"2013","unstructured":"Waltman L, van Eck NJ. A smart local moving algorithm for large-scale modularity-based community detection. Eur Phys J B. 2013;86(11):1\u201314.","journal-title":"Eur Phys J B"},{"key":"60_CR9","unstructured":"Spielman DA, Teng SH. A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. arXiv:0809.3232 ; 2008."},{"issue":"1","key":"60_CR10","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.patcog.2005.06.014","volume":"39","author":"H Qiu","year":"2006","unstructured":"Qiu H, Hancock ER. Graph matching and clustering using spectral partitions. Pattern Recognit. 2006;39(1):22\u201334.","journal-title":"Pattern Recognit"},{"issue":"4","key":"60_CR11","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1137\/08074489X","volume":"40","author":"D Spielman","year":"2011","unstructured":"Spielman D, Teng S. Spectral sparsification of graphs. SIAM J Comput. 2011;40(4):981\u20131025.","journal-title":"SIAM J Comput"},{"key":"60_CR12","unstructured":"Dongen S. Graph clustering by flow simulation. PhD thesis, Universiteit Utrecht, Utrecht, The Netherlands; 2000."},{"issue":"1","key":"60_CR13","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1186\/1471-2105-10-283","volume":"10","author":"K Macropol","year":"2009","unstructured":"Macropol K, Can T, Singh AK. RRW: repeated random walks on genome-scale protein networks for local cluster discovery. BMC Bioinform. 2009;10(1):283.","journal-title":"BMC Bioinform"},{"key":"60_CR14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.physa.2016.01.025","volume":"450","author":"Y Xin","year":"2016","unstructured":"Xin Y, Xie Z-Q, Yang J. The adaptive dynamic community detection algorithm based on the non-homogeneous random walking. Phys A Stat Mech Appl. 2016;450:241\u201352.","journal-title":"Phys A Stat Mech Appl"},{"key":"60_CR15","doi-asserted-by":"crossref","unstructured":"Chung F, Kempton M. A local clustering algorithm for connection graphs. In: Algorithms and models for the web graph; 2013. p. 26\u201343.","DOI":"10.1007\/978-3-319-03536-9_3"},{"key":"60_CR16","doi-asserted-by":"crossref","unstructured":"Macko P, Margo D, Seltzer M. Local clustering in provenance graphs. In: Proceedings of the 22nd ACM international conference on conference on information & knowledge management; 2013. p. 835\u2013840.","DOI":"10.1145\/2505515.2505624"},{"issue":"1","key":"60_CR17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/15427951.2007.10129139","volume":"4","author":"R Andersen","year":"2007","unstructured":"Andersen R, Chung F, Lang K. Using pagerank to locally partition a graph. Internet Math. 2007;4(1):35\u201364.","journal-title":"Internet Math"},{"key":"60_CR18","unstructured":"Buhler T, Rangapuram SS, Setzer S, Hein M. Constrained fractional set programs and their application in local clustering and community detection. arXiv:1306.3409 ; 2013."},{"key":"60_CR19","unstructured":"Zhu ZA, Lattanzi S, Mirrokni V. A local algorithm for finding well-connected clusters. In: Proceedings of the 30th international conference on machine learning (ICML-13); 2013. p. 396\u2013404."},{"key":"60_CR20","unstructured":"Norris JR. Markov chains applied probability and stochastic networks; 1998)"},{"key":"60_CR21","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-45294-X_3","volume-title":"Theoretical computer science","author":"D Harel","year":"2001","unstructured":"Harel D, Koren Y. On clustering using random walks. In: Hariharan R, Vinay V, Mukund M, et al., editors. Theoretical computer science., Lecture notes in computer scienceBerlin: Springer; 2001. p. 18\u201341."},{"key":"60_CR22","doi-asserted-by":"crossref","unstructured":"Cai B, Wang H, Zheng H, Wang H. An improved random walk based clustering algorithm for community detection in complex networks. In: 2011 IEEE international conference on systems, man, and cybernetics (SMC); 2011. p. 2162\u20132167.","DOI":"10.1109\/ICSMC.2011.6083997"},{"issue":"1","key":"60_CR23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S. MapReduce: simplified data processing on large clusters. Commun ACM. 2008;51(1):107\u201313.","journal-title":"Commun ACM"},{"key":"60_CR24","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"M Newman","year":"2010","unstructured":"Newman M. Networks: an introduction. 1st ed. New York: Oxford; 2010.","edition":"1"},{"issue":"11","key":"60_CR25","doi-asserted-by":"crossref","first-page":"11010","DOI":"10.1088\/1742-5468\/2006\/11\/P11010","volume":"2006","author":"L Danon","year":"2006","unstructured":"Danon L, D\u00edaz-Guilera A, Arenas A. The effect of size heterogeneity on community identification in complex networks. J Stat Mech Theory Exp. 2006;2006(11):11010.","journal-title":"J Stat Mech Theory Exp"},{"issue":"4","key":"60_CR26","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. Benchmark graphs for testing community detection algorithms. Phys Rev E. 2008;78(4):046110.","journal-title":"Phys Rev E"},{"issue":"2","key":"60_CR27","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M. Finding and evaluating community structure in networks. Phys Rev E. 2004;69(2):026113.","journal-title":"Phys Rev E"},{"key":"60_CR28","doi-asserted-by":"crossref","unstructured":"Ana LNF, Jain AK. Robust data clustering. In: Proceedings 2003 IEEE computer society conference on computer vision and pattern recognition, vol. 2; 2003. p. 128\u20131332.","DOI":"10.1109\/CVPR.2003.1211462"},{"issue":"09","key":"60_CR29","doi-asserted-by":"crossref","first-page":"09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","volume":"2005","author":"L Danon","year":"2005","unstructured":"Danon L, Diaz-Guilera A, Duch J, Arenas A. Comparing community structure identification. J Stat Mech Theory Exp. 2005;2005(09):09008.","journal-title":"J Stat Mech Theory Exp"},{"issue":"4","key":"60_CR30","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT. Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci. 2008;105(4):1118\u201323.","journal-title":"Proc Natl Acad Sci"},{"key":"60_CR31","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"1","author":"WW Zachary","year":"1977","unstructured":"Zachary WW. An information flow model for conflict and fission in small groups. J Anthropol Res. 1977;1:452\u201373.","journal-title":"J Anthropol Res"},{"issue":"1","key":"60_CR32","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.automatica.2011.09.019","volume":"48","author":"T Sahai","year":"2012","unstructured":"Sahai T, Speranzon A, Banaszuk A. Hearing the clusters of a graph: a distributed algorithm. Automatica. 2012;48(1):15\u201324.","journal-title":"Automatica"},{"key":"60_CR33","unstructured":"Leskovec J, Mcauley JJ. Learning to discover social circles in ego networks. In: Pereira F, Burges CJC, Bottou L, Weinberger KQ, editors. Advances in neural information processing systems 25; 2012. p. 539\u2013547."},{"key":"60_CR34","doi-asserted-by":"crossref","unstructured":"Kunegis J. Konect\u2014the Koblenz network collection. In: Proceedings of international conference on World Wide Web companion; 2013. p. 1343\u20131350.","DOI":"10.1145\/2487788.2488173"},{"issue":"4","key":"60_CR35","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. The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol. 2003;54(4):396\u2013405.","journal-title":"Behav Ecol Sociobiol"},{"issue":"04","key":"60_CR36","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1142\/S0219525903001067","volume":"06","author":"P Gleiser","year":"2003","unstructured":"Gleiser P, Danon L. Community structure in jazz. Adv Complex Syst. 2003;06(04):565\u201373.","journal-title":"Adv Complex Syst"},{"issue":"1","key":"60_CR37","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","volume":"271","author":"L Isella","year":"2011","unstructured":"Isella L, Stehl\u00e9 J, Barrat A, Cattuto C, Pinton JE, van den Broeck W. What\u2019s in a crowd? Analysis of face-to-face behavioral networks. J Theor Biol. 2011;271(1):166\u201380.","journal-title":"J Theor Biol"},{"key":"60_CR38","doi-asserted-by":"crossref","unstructured":"Adamic LA, Glance N. The political blogosphere and the 2004 US election: divided they blog. Proceedings of the 3rd international workshop on link discovery., LinkKDD \u201905New York: NY, USA; 2005. p. 36\u201343.","DOI":"10.1145\/1134271.1134277"},{"key":"60_CR39","first-page":"472","volume":"1102","author":"D Croft","year":"2013","unstructured":"Croft D, Mundo AF, Haw R, Milacic M, Weiser J, Wu G, Caudy M, Garapati P, Gillespie M, Kamdar MR, Jassal B, Jupe S, Matthews L, May B, Palatnik S, Rothfels K, Shamovsky V, Song H, Williams M, Birney E, Hermjakob H, Stein L, D\u2019Eustachio P. The reactome pathway knowledgebase. Nucleic Acids Res. 2013;1102:472\u20137.","journal-title":"Nucleic Acids Res"},{"key":"60_CR40","unstructured":"Leskovec J. Stanford large network dataset collection."},{"key":"60_CR41","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J. Defining and evaluating network communities based on ground-truth. arXiv:1205.6233 ; 2012.","DOI":"10.1145\/2350190.2350193"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-016-0060-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s40537-016-0060-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-016-0060-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T00:07:48Z","timestamp":1568592468000},"score":1,"resource":{"primary":{"URL":"http:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-016-0060-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["60"],"URL":"https:\/\/doi.org\/10.1186\/s40537-016-0060-5","relation":{},"ISSN":["2196-1115"],"issn-type":[{"type":"electronic","value":"2196-1115"}],"subject":[],"published":{"date-parts":[[2016,12]]},"article-number":"26"}}