{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:23:24Z","timestamp":1762521804516,"version":"3.41.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,13]],"date-time":"2015-05-13T00:00:00Z","timestamp":1431475200000},"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":["Cluster Comput"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10586-015-0452-x","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T11:20:57Z","timestamp":1431429657000},"page":"999-1010","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Community structure mining in big data social media networks with MapReduce"],"prefix":"10.1007","volume":"18","author":[{"given":"Songchang","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wangqun","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuqiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aiping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,13]]},"reference":[{"issue":"6","key":"452_CR1","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1007\/s00224-006-1350-7","volume":"39","author":"K Andreev","year":"2006","unstructured":"Andreev, K., Racke, H.: Balanced graph partitioning. Theory Comput. Syst. 39(6), 929\u2013939 (2006)","journal-title":"Theory Comput. Syst."},{"key":"452_CR2","unstructured":"Borthakur, D.: HDFS architecture guide, HADOOP APACHE PROJECT. http:\/\/hadoop.apache.org\/common\/docs\/current\/hdfs_design (2008)"},{"key":"452_CR3","doi-asserted-by":"crossref","unstructured":"Cambria, E., Rajagopal, D., Olsher, D., Das, D.: Big social data analysis. Big Data Comput. 401\u2013414 (2013)","DOI":"10.1201\/b16014-19"},{"key":"452_CR4","first-page":"359","volume":"53","author":"Y Chen","year":"2009","unstructured":"Chen, Y., Huang, C., Zhai, K.: Scalable community detection algorithm with MapReduce. Commun. ACM 53, 359\u2013366 (2009)","journal-title":"Commun. ACM"},{"issue":"6","key":"452_CR5","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004)","journal-title":"Phys. Rev. E"},{"key":"452_CR6","unstructured":"Cooper, S.: The largest social networks in the world include some big surprises, Business Insider, New York, USA. http:\/\/www.businessinsider.com\/the-largest-social-networks-in-the-world-2013-12 Accessed Jan 2014"},{"issue":"1","key":"452_CR7","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 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"issue":"3","key":"452_CR8","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.: Community detection in graphs. Phys. Rep. 486(3), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"issue":"12","key":"452_CR9","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"04","key":"452_CR10","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1142\/S0219525903001067","volume":"6","author":"PM Gleiser","year":"2003","unstructured":"Gleiser, P.M., Danon, L.: Community structure in jazz. Adv. Complex Syst. 6(04), 565\u2013573 (2003)","journal-title":"Adv. Complex Syst."},{"issue":"9","key":"452_CR11","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum redundancy codes. Proc. IRE 40(9), 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"key":"452_CR12","doi-asserted-by":"crossref","DOI":"10.1142\/1676","volume-title":"Information Theory for Continuous Systems","author":"S Ihara","year":"1993","unstructured":"Ihara, S.: Information Theory for Continuous Systems. World Scientific, Singapore (1993)"},{"key":"452_CR13","doi-asserted-by":"crossref","unstructured":"Jin, S., Li, A., Yang, S., Lin, W., Deng, B., Li, S.: A MapReduce and information compression based social community structure mining method, IEEE 16th International Conference on Computational Science and Engineering (CSE), 2013, pp. 971\u2013980. (2013)","DOI":"10.1109\/CSE.2013.143"},{"key":"452_CR14","unstructured":"Jin, S., Yu, P., Li, S., Yang, S.: A parallel community structure mining method in big social networks, mathematical problems in engineering, (in Press) http:\/\/downloads.hindawi.com\/journals\/mpe\/aip\/934301 (2014)"},{"key":"452_CR15","unstructured":"Kalyanaraman, R.A.: An efficient MapReduce algorithm for parallelizing large-scale graph clustering,In: ParGraph\u2014Workshop on Parallel Algorithms and Software for Analysis of Massive Graphs, Held in conjunction with HiPC\u201911. Bengaluru, India (2011)"},{"issue":"2","key":"452_CR16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient Heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013308 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"452_CR17","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 78(4), 046110 (2008)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"452_CR18","doi-asserted-by":"crossref","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Community detection algorithms: a comparative analysis. Phys. Rev. E 80(5), 056117 (2009)","journal-title":"Phys. Rev. E"},{"key":"452_CR19","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K. J., & Mahoney, M.: Empirical comparison of algorithms for network community detection. In: Proceedings of the 19th international conference on World wide web, 631\u2013640 (2010)","DOI":"10.1145\/1772690.1772755"},{"key":"452_CR20","unstructured":"MacQueen, J.: Some methods for classification and analysis of multivariate observations, In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability. 1(14), 281\u2013297 (1967)"},{"issue":"6","key":"452_CR21","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)","journal-title":"Phys. Rev. E"},{"issue":"08","key":"452_CR22","doi-asserted-by":"crossref","first-page":"P08001","DOI":"10.1088\/1742-5468\/2012\/08\/P08001","volume":"2012","author":"GK Orman","year":"2012","unstructured":"Orman, G.K., Labatut, V., Cherifi, H.: Comparative evaluation of community detection algorithms: a topological approach. J. Stat. Mech. Theory Exp. 2012(08), P08001 (2012)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"452_CR23","unstructured":"Pasco, R.C.: Source coding algorithms for fast data compression. Stanford University, Ph.D. dissertation (1976)"},{"key":"452_CR24","volume-title":"Survey on Social Community Detection, Social Media Retrieval","author":"M Planti\u00e9","year":"2013","unstructured":"Planti\u00e9, M., Michel, C.: Survey on Social Community Detection, Social Media Retrieval. Springer, London (2013)"},{"issue":"3","key":"452_CR25","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Liou, K.P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(3), 430 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"9","key":"452_CR26","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.: Defining and identifying communities in networks. Proc. Natl. Acad. Sci. USA 101(9), 2658\u20132663 (2004)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"452_CR27","doi-asserted-by":"crossref","unstructured":"Riedy, E.J., Meyerhenke, H., Ediger, D., Bader, D.A.: Parallel community detection for massive graphs. In: Parallel Processing and Applied Mathematics, pp. 286\u2013296. Springer, Berlin Heidelberg (2012)","DOI":"10.1007\/978-3-642-31464-3_29"},{"key":"452_CR28","doi-asserted-by":"crossref","unstructured":"Rosvall, M., Esquivel, A., Lancichinetti, A., West, J., Lambiotte, R.: Memory in network flows and its effects on spreading dynamics and community detection. Nat. Commun. 5, 2014, doi: 10.1038\/ncomms5630","DOI":"10.1038\/ncomms5630"},{"issue":"18","key":"452_CR29","doi-asserted-by":"crossref","first-page":"7327","DOI":"10.1073\/pnas.0611034104","volume":"104","author":"M Rosvall","year":"2007","unstructured":"Rosvall, M., Bergstrom, C.T.: An information-theoretic framework for resolving community structure in complex networks. Proc. Natl. Acad. Sci. 104(18), 7327\u20137331 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"1","key":"452_CR30","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall, M., Bergstrom, C.T.: The map equation. Eur. Phys. J. Spec. Top. 178(1), 13\u201323 (2009)","journal-title":"Eur. Phys. J. Spec. Top."},{"issue":"1","key":"452_CR31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/584091.584093","volume":"5","author":"CE Shannon","year":"2001","unstructured":"Shannon, C.E.: A mathematical theory of communication. ACM SIGMOBILE Mobile Comput. Commun. Rev. 5(1), 3\u201355 (2001)","journal-title":"ACM SIGMOBILE Mobile Comput. Commun. Rev."},{"key":"452_CR32","unstructured":"Staudt, C.L., Meyerhenke, H.: Engineering parallel algorithms for community detection in massive networks. arXiv:1304.4453 (2014)"},{"key":"452_CR33","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-1-4419-7142-5_16","volume-title":"Handbook of Social Network Technologies and Applications","author":"B Yang","year":"2010","unstructured":"Yang, B., Liu, D., Liu, J.: Discovering communities from social networks: methodologies and applications. In: Furht, B. (ed.) Handbook of Social Network Technologies and Applications, pp. 331\u2013346. Springer, New York, USA (2010)"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-015-0452-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-015-0452-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-015-0452-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T23:15:05Z","timestamp":1748387705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-015-0452-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,13]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["452"],"URL":"https:\/\/doi.org\/10.1007\/s10586-015-0452-x","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2015,5,13]]}}}