Abstract
Multidimensionality in social networks is a great issue that came out into view as a result of that most social media sites such as Facebook, Twitter, and YouTube allow people to interact with each other through different social activities. The community detection in such multidimensional social networks has attracted a lot of attention in the recent years. When dealing with these networks the concept of community detection changes to be, the discovery of the shared group structure across all network dimensions such that members in the same group interact with each other more frequently than those outside the group. Most of the studies presented on the topic of community detection assume that there is only one kind of relation in the network. In this paper, we propose a multi-objective approach, named MOGA-MDNet, to discover communities in multidimensional networks, by applying genetic algorithms. The method aims to find community structure that simultaneously maximizes modularity, as an objective function, in all network dimensions. This method does not need any prior knowledge about number of communities. Experiments on synthetic and real life networks show the capability of the proposed algorithm to successfully detect the structure hidden within these networks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Wasserman, S.: Social Network Analysis: Methods and Applications, vol. 8. Cambridge University Press, Cambridge (1994)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)
Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10008 (2008)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)
Plantié, M., Crampes, M.: Survey on social community detection. In: Social Media Retrieval, pp. 65–85. Springer, Berlin (2013)
Duch, J., Arenas, A.: Community detection in complex networks using extremal optimization. Phys. Rev. E 72(2), 027104 (2005)
Liu, J., Liu, T.: Detecting community structure in complex networks using simulated annealing with k-means algorithms. Physica A: Stat. Mech. Appl. 389(11), 2300–2309 (2010)
Hafez, A.I., Al-Shammari, E.T., Hassanien, A.E., Fahmy, A.A.: Genetic algorithms for multi-objective community detection in complex networks. In: Social Networks: A Framework of Computational Intelligence, pp. 145–171. Springer (2014)
Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A., Pedreschi, D.: Multidimensional networks: foundations of structural analysis. World Wide Web 16(5–6), 567–593 (2013)
Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A., Pedreschi, D.: Foundations of multidimensional network analysis. In: International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 485–489. IEEE (2011)
Berlingerio, M., Coscia, M., Giannotti, F.: Finding and characterizing communities in multidimensional networks. In: International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 490–494. IEEE (2011)
Fortin, F.-A., Rainville, D., Gardner, M.-A.G., Parizeau, M., Gagné, C., et al.: Deap: evolutionary algorithms made easy. J. Mach. Learn. Res. 13(1), 2171–2175 (2012)
Cai, D., Shao, Z., He, X., Yan, X., Han, J.: Community mining from multi-relational networks. In: Knowledge Discovery in Databases: PKDD 2005, pp. 445–452. Springer, Heidelberg (2005)
Tang, L., Liu, H.: Uncovering cross-dimension group structures in multi-dimensional networks. In: SDM workshop on Analysis of Dynamic Networks (2009)
Park, Y., Song, M.S.: A genetic algorithm for clustering problems. In: Proceedings of the Third Annual Conference on Genetic Programming, pp. 568–575 (1998)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. Mit Press, Cambridge (2003)
Pizzuti, C.: GA-Net: a genetic algorithm for community detection in social networks. In: Parallel Problem Solving from Nature PPSN X. LNCS, pp. 1081–1090. Springer, Heidelberg (2008)
Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)
White, S., Smyth, P.: A spectral clustering approach to finding communities in graph. In: SDM, vol. 5, pp. 76–84. SIAM (2005)
Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)
Danon, L., Diaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. J. Stat. Mech. Theory Exp. 2005(09), P09008 (2005)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii. Lecture Notes in Computer Science, vol. 2000, pp. 849–858 (1917)
Fire, M., Katz, G., Elovici, Y., Shapira, B., Rokach, L.: Predicting student exam’s scores by analyzing social network data. In: Active Media Technology, pp. 584–595. Springer, Berlin (2012)
Samuel, J., Katz, C.E., Menzel, H., et al.: Medical innovation: a diffusion study. Bobbs-Merrill Indianap. (1966)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Ahmed, M.M., Hafez, A.I., Elwakil, M.M., Hassanien, A.E., Hassanien, E. (2016). A Multi-Objective Genetic Algorithm for Community Detection in Multidimensional Social Network. In: Gaber, T., Hassanien, A., El-Bendary, N., Dey, N. (eds) The 1st International Conference on Advanced Intelligent System and Informatics (AISI2015), November 28-30, 2015, Beni Suef, Egypt. Advances in Intelligent Systems and Computing, vol 407. Springer, Cham. https://doi.org/10.1007/978-3-319-26690-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-26690-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26688-6
Online ISBN: 978-3-319-26690-9
eBook Packages: Computer ScienceComputer Science (R0)