{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:36:42Z","timestamp":1761917802476},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,3,4]],"date-time":"2014-03-04T00:00:00Z","timestamp":1393891200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s13278-014-0179-3","type":"journal-article","created":{"date-parts":[[2014,3,4]],"date-time":"2014-03-04T00:19:26Z","timestamp":1393892366000},"source":"Crossref","is-referenced-by-count":8,"title":["Scalable graph clustering with parallel approximate PageRank"],"prefix":"10.1007","volume":"4","author":[{"given":"Bryan","family":"Perozzi","sequence":"first","affiliation":[]},{"given":"Christopher","family":"McCubbin","sequence":"additional","affiliation":[]},{"given":"J. T.","family":"Halbert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,4]]},"reference":[{"issue":"7307","key":"179_CR1","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"Y Ahn","year":"2010","unstructured":"Ahn Y, Bagrow J, Lehmann S (2010) Link communities reveal multiscale complexity in networks. Nature 466(7307):761\u2013764","journal-title":"Nature"},{"key":"179_CR2","unstructured":"Andersen R, Peres Y (2008) Finding sparse cuts locally using evolving sets. CoRR abs\/0811.3779"},{"key":"179_CR3","doi-asserted-by":"crossref","unstructured":"Andersen R, Chung F, Lang K (2006) Local graph partitioning using pagerank vectors. In: Foundations of Computer Science, 2006. FOCS\u201906. 47th Annual IEEE Symposium on, IEEE, pp 475\u2013486","DOI":"10.1109\/FOCS.2006.44"},{"key":"179_CR4","unstructured":"Apache Giraph (2012) Apache giraph. http:\/\/incubator.apache.org\/giraph\/"},{"key":"179_CR5","doi-asserted-by":"crossref","unstructured":"Bahmani B, Chakrabarti K, Xin D (2011) Fast personalized pagerank on mapreduce. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data, ACM, New York, NY, USA, SIGMOD \u201911, pp 973\u2013984, doi: 10.1145\/1989323.1989425","DOI":"10.1145\/1989323.1989425"},{"key":"179_CR6","doi-asserted-by":"crossref","unstructured":"Blondel V, Guillaume J, Lambiotte R, Mech E (2008) Fast unfolding of communities in large networks. J Stat Mech p P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"179_CR7","doi-asserted-by":"crossref","unstructured":"Chung FRK (1996) Spectral graph theory (CBMS Regional Conference Series in Mathematics, No. 92) American Mathematical Society","DOI":"10.1090\/cbms\/092"},{"issue":"1","key":"179_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113 doi: 10.1145\/1327452.1327492","journal-title":"Commun ACM"},{"issue":"3","key":"179_CR9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1080\/15427951.2005.10129104","volume":"2","author":"D Fogaras","year":"2005","unstructured":"Fogaras D, R\u00e1cz B, Csalog\u00e1ny K, Sarl\u00f3s T (2005) Towards scaling fully personalized pagerank: algorithms, lower bounds, and experiments. Internet Math 2(3):333\u2013358","journal-title":"Internet Math"},{"key":"179_CR10","unstructured":"Gleich DF, Seshadhri C (2012) Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In: KDD, pp 597\u2013605"},{"key":"179_CR11","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (2012) Powergraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX conference on operating systems design and implementation, USENIX Association, Berkeley, CA, USA, OSDI\u201912, pp 17\u201330"},{"key":"179_CR12","doi-asserted-by":"crossref","unstructured":"Good BH, de Montjoye YA, Clauset A (2010) Performance of modularity maximization in practical contexts. Phys Rev E 81(4):046,106","DOI":"10.1103\/PhysRevE.81.046106"},{"issue":"3","key":"179_CR13","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R Kannan","year":"2004","unstructured":"Kannan R, Vempala S, Vetta A (2004) On clusterings: good, bad and spectral. J ACM 51(3):497\u2013515 doi: 10.1145\/990308.990313","journal-title":"J ACM"},{"key":"179_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2008) Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th international conference on World Wide Web, ACM, New York, NY, USA, WWW \u201908, pp 695\u2013704, doi: 10.1145\/1367497.1367591","DOI":"10.1145\/1367497.1367591"},{"issue":"1","key":"179_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2200\/S00274ED1V01Y201006HLT007","volume":"3","author":"J Lin","year":"2010","unstructured":"Lin J, Dyer C (2010) Data-intensive text processing with mapreduce. Synth Lect Hum Lang Technol 3(1):1\u2013177","journal-title":"Synth Lect Hum Lang Technol"},{"key":"179_CR16","doi-asserted-by":"crossref","unstructured":"Lin J, Schatz M (2010) Design patterns for efficient graph algorithms in mapreduce. In: Proceedings of the eighth workshop on mining and learning with graphs, ACM, pp 78\u201385","DOI":"10.1145\/1830252.1830263"},{"issue":"4","key":"179_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/rsa.3240040402","volume":"4","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz L, Simonovits M (1993) Random walks in a convex body and an improved volume algorithm. Random Struct Algorithms 4(4):359\u2013412 doi: 10.1002\/rsa.3240040402","journal-title":"Random Struct Algorithms"},{"key":"179_CR18","unstructured":"Mahoney MW, Orecchia L, Vishnoi NK (2012) A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally. JMLR 13:2339\u20132365"},{"key":"179_CR19","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data, ACM, New York, NY, USA, SIGMOD \u201910, pp 135\u2013146, doi: 10.1145\/1807167.1807184","DOI":"10.1145\/1807167.1807184"},{"issue":"7","key":"179_CR20","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.parco.2004.04.001","volume":"30","author":"ML Massie","year":"2004","unstructured":"Massie ML, Chun BN, Culler DE (2004) The ganglia distributed monitoring system: design, implementation, and experience. Parallel Comput 30(7):817\u2013840","journal-title":"Parallel Comput"},{"key":"179_CR21","doi-asserted-by":"crossref","unstructured":"McCubbin C, Perozzi B, Levine A, Rahman A (2011) Finding the \u2019needle\u2019: locating interesting nodes using the k-shortest paths algorithm in mapreduce. 2011 IEEE international conference on data mining workshops 0:180\u2013187, doi: 10.1109\/ICDMW.2011.84","DOI":"10.1109\/ICDMW.2011.84"},{"issue":"3","key":"179_CR22","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1239\/jap\/1222441818","volume":"45","author":"P Neal","year":"2008","unstructured":"Neal P (2008) The generalised coupon collector problem. J Appl Probab 45(3):621\u2013629 doi: 10.1239\/jap\/1222441818","journal-title":"J Appl Probab"},{"key":"179_CR23","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026,113"},{"issue":"23","key":"179_CR24","doi-asserted-by":"crossref","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. Proceedings of the National Academy of Sciences 103(23): 8577\u20138582 doi: 10.1073\/pnas.0601602103","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"179_CR25","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 (2007) Graph clustering. Comput Sci Rev 1(1):27\u201364","journal-title":"Comput Sci Rev"},{"key":"179_CR26","doi-asserted-by":"crossref","unstructured":"Spielman D, Teng S (2004) Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the thirty-sixth annual ACM symposium on theory of computing, ACM, pp 81\u201390","DOI":"10.1145\/1007352.1007372"},{"key":"179_CR27","unstructured":"Spielman DA, Teng SH (2008) A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. CoRR abs\/0809.3232"},{"key":"179_CR28","unstructured":"White T (2009) Hadoop: the definitive guide, 1st edn. O\u2019Reilly Media, Inc., Sebastopol, California, USA"},{"key":"179_CR29","unstructured":"Yang J, Leskovec J (2012) Structure and overlaps of communities in networks. CoRR abs\/1205.6228"},{"key":"179_CR30","doi-asserted-by":"crossref","unstructured":"Zhao Z, Wang G, Butt A, Khan M, Kumar V, Marathe M (2012) Sahad: subgraph analysis in massive networks using hadoop. In: parallel and distributed processing symposium (IPDPS), 2012 IEEE 26th international, IEEE, pp 390\u2013401","DOI":"10.1109\/IPDPS.2012.44"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-014-0179-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-014-0179-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-014-0179-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T03:48:16Z","timestamp":1565236096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-014-0179-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,4]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["179"],"URL":"https:\/\/doi.org\/10.1007\/s13278-014-0179-3","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,4]]},"article-number":"179"}}