A New Approach to Detect At-Risk Learning Communities in Social Networks

  • Meriem AdraouiEmail author
  • Asmaâ Retbi
  • Mohammed Khalidi Idrissi
  • Samir Bennani
Conference paper
Part of the Learning and Analytics in Intelligent Systems book series (LAIS, volume 7)


Learning community detection in social networks has an important role to understand and to analyze the network structure. The main objective of our study is to evaluate learning communities based on interactions between learners. To meet this goal, we propose a new algorithm called Community Detection and Evaluation Algorithm (EDCA). This algorithm detects learning communities using a new centrality measure named “safely centrality” that allows to detect safe learners. These learners represent the initial nodes of communities. Afterward, we identify neighbors of each safe learner to build communities. In order to test the performance of our method, we compare our proposed algorithm with three community detection algorithms in two learning networks using the modularity and the Adjusted Rand Index (ARI) metrics. Our experimental phase demonstrates the quality of our proposed algorithm.


Learning community Safe learners Community detection Evaluation Centrality At-risk 


  1. 1.
    McConnell, E., et al.: “Everybody puts their whole life on Facebook”: identity management and the online social networks of LGBTQ youth. Int. J. Environ. Res. Public Health 15, 1078 (2018)CrossRefGoogle Scholar
  2. 2.
    Stacey, E.: Social presence online: networking learners at a distance. In: Watson, D., Andersen, J. (eds.) Networking the Learner: Computers in Education, pp. 39–48 (2002)CrossRefGoogle Scholar
  3. 3.
    Ferguson, R., Shum, S.B.: Social learning analytics: five approaches. In: Proceedings of the 2nd International Conference on Learning Analytics and Knowledge, pp. 23–33. ACM (2012)Google Scholar
  4. 4.
    Elyazid, A., Brahim, O., Bouchra, F.: A comparative study of some algorithms for detecting communities in social networks. In: 2016 4th IEEE International Colloquium on Information Science and Technology (CiSt), pp. 257–262 (2016)Google Scholar
  5. 5.
    Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Wang, Y., Di, Z., Fan, Y.: Identifying and characterizing nodes important to community structure using the spectrum of the graph. PLoS ONE 6, e27418 (2011)CrossRefGoogle Scholar
  7. 7.
    Martin, F., Ndoye, A.: Using learning analytics to assess student learning in online courses. J. Univ. Teach. Learn. Pract. 13, 7 (2016)Google Scholar
  8. 8.
    Inderawati, R., Pratama, A.H., Loeneto, B.A.: Peer assessment in Facebook comment column about one topic in writing II subject of the fourth semester students of Sriwijaya University English study program. Engl. FRANCA Acad. J. Engl. Lang. Educ. 2, 49–72 (2018)CrossRefGoogle Scholar
  9. 9.
    Harmon, O.R., Tomolonis, P.A.: The effects of using Facebook as a discussion forum in an online principles of economics course: Results of a randomized controlled trial. Int. Rev. Econ. Educ. 30, 100157 (2019)CrossRefGoogle Scholar
  10. 10.
    Jokar, E., Mosleh, M.: Community detection in social networks based on improved Label Propagation Algorithm and balanced link density. Phys. Lett. A 383, 718–727 (2019)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Nikolaev, A.G., Razib, R., Kucheriya, A.: On efficient use of entropy centrality for social network analysis and community detection. Soc. Netw. 40, 154–162 (2015)CrossRefGoogle Scholar
  12. 12.
    Li, X., et al.: Communities detection in social network based on local edge centrality. Phys. Stat. Mech. Appl. 531, 121552 (2019)CrossRefGoogle Scholar
  13. 13.
    Adraoui, M., Retbi, A., Idrissi, M.K., Bennani, S.: Evaluate learning communities in the online social media: Facebook groups. In: Proceedings of the 12th International Conference on Intelligent Systems: Theories and Applications (2018)Google Scholar
  14. 14.
    Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 105, 1118–1123 (2008)CrossRefGoogle Scholar
  15. 15.
    Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)MathSciNetCrossRefGoogle Scholar
  16. 16.
    He, Z., Deng, S., Xu, X., Huang, J.Z.: A fast greedy algorithm for outlier mining. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 567–576. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  17. 17.
    Heidler, R., Gamper, M., Herz, A., Eßer, F.: Relationship patterns in the 19th century: the friendship network in a German boys’ school class from 1880 to 1881 revisited. Soc. Netw. 37, 1–13 (2014)CrossRefGoogle Scholar
  18. 18.
    Martín, E., Gértrudix, M., Urquiza Fuentes, J., Haya, P.A.: Student activity and profile datasets from an online video-based collaborative learning experience. Br. J. Educ. Technol. 46, 993–998 (2015)CrossRefGoogle Scholar
  19. 19.
    Labatut, V.: Generalized measures for the evaluation of community detection methods. Int. J. Soc. Netw. Min. 2, 44 (2015)CrossRefGoogle Scholar
  20. 20.
    Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2, 193–218 (1985)CrossRefGoogle Scholar
  21. 21.
    Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103, 8577–8582 (2006)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Meriem Adraoui
    • 1
    Email author
  • Asmaâ Retbi
    • 1
  • Mohammed Khalidi Idrissi
    • 1
  • Samir Bennani
    • 1
  1. 1.RIME TEAM-Networking, Modeling and e-Learning Team, LRIE Laboratory, Research in Computer Science and Education Laboratory-Mohammadia School of Engineers (EMI)Mohammed V University in RabatRabatMorocco

Personalised recommendations