Abstract
Community detection has been wildly studied during the past years by varies of researchers, and a plenty of excellent algorithms and approaches have been proposed. But networks are becoming larger and higher complicated in nowadays. How to excavate the hidden community structures in the expanding networks quickly with existing excellent methods has become a challenge. In this paper, we designed a parallel community discovery framework based on Map-reduce and implemented parallel version of some excellent existing standalone community detection methods. Results of empirical tests show that the framework is able to significantly speed up the mining process without compromising the accuracy excessively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences 99(12), 7821–7826 (2002)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)
Boccaletti, S., Latora, V., Moreno, Y., Chavez, M., Hwang, D.U.: Complex networks: Structure and dynamics. Physics Reports 424(4), 175–308 (2006)
Johnson, S.C.: Hierarchical clustering schemes. Psychometrika 32(3), 241–254 (1967)
Cooper, S.: The largest social networks in the world include some big surprises [Business Insider] (January 8, 2014), http://www.businessinsider.com/the-largest-social-networks-in-the-world-2013-12 (retrieved from)
Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Communications of the ACM 51(1), 107–113 (2008)
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–472. ACM (1999)
Karypis, G., Kumar, V.: A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm. In: PPSC (1997)
Karypis, G., Kumar, V.: Multilevel k-way hypergraph partitioning. VLSI Design 11(3), 285–300 (2000)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49(2), 291–307 (1970)
Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: 19th Conference on Design Automation, pp. 175–181. IEEE (1982)
Fortunato, S.: Community detection in graphs. Physics Reports 486(3), 75–174 (2010)
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 33(1), 47–52 (2011)
Porter, M.A., Onnela, J.P., Mucha, P.J.: Communities in networks. Notices of the AMS 56(9), 1082–1097 (2009)
Yang, B., Liu, D., Liu, J.: Discovering Communities from Social Networks: Methodologies and Applications. In: Handbook for Social Network Technologies and Applications, pp. 331–346. Springer US (2010)
Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. PloS One 6(4), e18961 (2011)
Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Physical Review EÂ 69(2), 026113 (2004)
Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Structures & Algorithms 6(2-3), 161–180 (1995)
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008(10), P10008 (2008)
Rosvall, M., Bergstrom, C.T.: Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. PloS One 6(4), e18209 (2011)
Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences 105(4), 1118–1123 (2008)
Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Physical Review EÂ 78(4), 046110 (2008)
Strehl, A., Ghosh, J.: Cluster ensembles—a knowledge reuse framework for combining multiple partitions. The Journal of Machine Learning Research 3, 583–617 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Jin, S. et al. (2014). A Parallel and Scalable Framework for Non-overlapping Community Detection Algorithms. In: Han, W., Huang, Z., Hu, C., Zhang, H., Guo, L. (eds) Web Technologies and Applications. APWeb 2014. Lecture Notes in Computer Science, vol 8710. Springer, Cham. https://doi.org/10.1007/978-3-319-11119-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-11119-3_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11118-6
Online ISBN: 978-3-319-11119-3
eBook Packages: Computer ScienceComputer Science (R0)