{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:33:35Z","timestamp":1725798815263},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319111186"},{"type":"electronic","value":"9783319111193"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11119-3_11","type":"book-chapter","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T16:40:33Z","timestamp":1408034433000},"page":"115-126","source":"Crossref","is-referenced-by-count":0,"title":["A Parallel and Scalable Framework for Non-overlapping Community Detection Algorithms"],"prefix":"10.1007","author":[{"given":"Songchang","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuchao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanping","family":"Nie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aiping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuqiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"11_CR1","doi-asserted-by":"publisher","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. Proceedings of the National Academy of Sciences\u00a099(12), 7821\u20137826 (2002)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"6684","key":"11_CR2","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature\u00a0393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S. Boccaletti","year":"2006","unstructured":"Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U.: Complex networks: Structure and dynamics. Physics Reports\u00a0424(4), 175\u2013308 (2006)","journal-title":"Physics Reports"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02289588","volume":"32","author":"S.C. Johnson","year":"1967","unstructured":"Johnson, S.C.: Hierarchical clustering schemes. Psychometrika\u00a032(3), 241\u2013254 (1967)","journal-title":"Psychometrika"},{"key":"11_CR5","unstructured":"Cooper, S.: The largest social networks in the world include some big surprises [Business Insider] (January 8, 2014), \n                    \n                      http:\/\/www.businessinsider.com\/the-largest-social-networks-in-the-world-2013-12\n                    \n                    \n                   (retrieved from)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","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. Communications of the ACM\u00a051(1), 107\u2013113 (2008)","journal-title":"Communications of the ACM"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: Complexity of graph partition problems. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 464\u2013472. ACM (1999)","DOI":"10.1145\/301250.301373"},{"key":"11_CR8","unstructured":"Karypis, G., Kumar, V.: A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm. In: PPSC (1997)"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1155\/2000\/19436","volume":"11","author":"G. Karypis","year":"2000","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. VLSI Design\u00a011(3), 285\u2013300 (2000)","journal-title":"VLSI Design"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal\u00a049(2), 291\u2013307 (1970)","journal-title":"Bell System Technical Journal"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: 19th Conference on Design Automation, pp. 175\u2013181. IEEE (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","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. Physics Reports\u00a0486(3), 75\u2013174 (2010)","journal-title":"Physics Reports"},{"issue":"1","key":"11_CR13","first-page":"47","volume":"33","author":"Z.G. Luo","year":"2011","unstructured":"Luo, Z.G., Ding, F., Jiang, X.Z., Shi, J.L.: New progress on community detection in complex networks. Journal of National University of Defense Technology\u00a033(1), 47\u201352 (2011)","journal-title":"Journal of National University of Defense Technology"},{"issue":"9","key":"11_CR14","first-page":"1082","volume":"56","author":"M.A. Porter","year":"2009","unstructured":"Porter, M.A., Onnela, J.P., Mucha, P.J.: Communities in networks. Notices of the AMS\u00a056(9), 1082\u20131097 (2009)","journal-title":"Notices of the AMS"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Yang, B., Liu, D., Liu, J.: Discovering Communities from Social Networks: Methodologies and Applications. In: Handbook for Social Network Technologies and Applications, pp. 331\u2013346. Springer US (2010)","DOI":"10.1007\/978-1-4419-7142-5_16"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. PloS One\u00a06(4), e18961 (2011)","DOI":"10.1371\/journal.pone.0018961"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E\u00a069(2), 026113 (2004)","DOI":"10.1103\/PhysRevE.69.026113"},{"issue":"2-3","key":"11_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/rsa.3240060204","volume":"6","author":"M. Molloy","year":"1995","unstructured":"Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Structures & Algorithms\u00a06(2-3), 161\u2013180 (1995)","journal-title":"Random Structures & Algorithms"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment\u00a02008(10), P10008 (2008)","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Rosvall, M., Bergstrom, C.T.: Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. PloS One\u00a06(4), e18209 (2011)","DOI":"10.1371\/journal.pone.0018209"},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M. Rosvall","year":"2008","unstructured":"Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences\u00a0105(4), 1118\u20131123 (2008)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Physical Review E\u00a078(4), 046110 (2008)","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"11_CR23","first-page":"583","volume":"3","author":"A. Strehl","year":"2003","unstructured":"Strehl, A., Ghosh, J.: Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. The Journal of Machine Learning Research\u00a03, 583\u2013617 (2003)","journal-title":"The Journal of Machine Learning Research"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11119-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:26:32Z","timestamp":1558959992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11119-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319111186","9783319111193"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11119-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}