Skip to main content
SpringerLink
Log in

Community Graph Elicitation from Students’ Interactions in Virtual Learning Environments

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2018 (ICCSA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10962))

Included in the following conference series:

Abstract

In this work we introduce a novel graph-based approach to elicit students’ communities. Teaching, in the blended learning environment, is delivered as a mixture of online and offline activities. While the online activities can be tracked and analysed in the Virtual Learning Environment, the offline activities fall out of the educators’ control scope. In this educational setting, communications take place using side channels, such as the instant messaging applications and social network platform. Using our approach, the students’ groupings and social interactions can be elicited by analysing the student-system interactions. The co-occurrence of interactions among the students give information about their social connections. This conveys information useful to elicit the students’ interaction graph and the student communities contained in it. Students’ leader-follower community structure can be elicited starting from the interaction network. This can empower teachers to plan and revise their Learning Designs as well as to identify situations that need teacher’s intervention, e.g. students at risk of failing the exam and/or dropping the studies.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010). https://doi.org/10.1016/j.physrep.2009.11.002

    Article  MathSciNet  Google Scholar 

  2. Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291–307 (1970). https://doi.org/10.1002/j.1538-7305.1970.tb01770.x

    Article  MATH  Google Scholar 

  3. Pothen, A.: Graph partitioning algorithms with applications to scientific computing. ICASE LaRC Interdiscip. Ser. Sci. Eng. 4, 323–368 (1997). https://doi.org/10.1007/978-94-011-5412-3

    Article  MathSciNet  MATH  Google Scholar 

  4. Franzoni, V., Li, Y., Mengoni, P., Milani, A.: Clustering Facebook for biased context extraction. In: Gervasi, O., et al. (eds.) ICCSA 2017. LNCS, vol. 10404, pp. 717–729. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62392-4_52

    Chapter  Google Scholar 

  5. Franzoni, V., Milani, A., Biondi, G.: SEMO. In: Proceedings of the International Conference on Web Intelligence - WI 2017, pp. 953–958 (2017). https://doi.org/10.1145/3106426.3109417

  6. Franzoni, V., Biondi, G., Milani, A.: A web-based system for emotion vector extraction. In: Gervasi, O., et al. (eds.) ICCSA 2017. LNCS, vol. 10406, pp. 653–668. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62398-6_46

    Chapter  Google Scholar 

  7. Biondi, G., Franzoni, V., Li, Y., Milani, A.: Web-based similarity for emotion recognition in web objects. In: Proceedings of the 9th International Conference on Utility and Cloud Computing - UCC 2016, pp. 327–332 (2016). https://doi.org/10.1145/2996890.3007883

  8. Biondi, G., Franzoni, V., Poggioni, V.: A deep learning semantic approach to emotion recognition using the IBM Watson Bluemix Alchemy Language. In: Gervasi, O., et al. (eds.) ICCSA 2017. LNCS, vol. 10406, pp. 718–729. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62398-6_51

    Chapter  Google Scholar 

  9. Franzoni, V., Li, Y., Mengoni, P.: A path-based model for emotion abstraction on Facebook using sentiment analysis and taxonomy knowledge. In: Proceedings of the International Conference Web Intell. - WI 2017, pp. 947–952 (2017). https://doi.org/10.1145/3106426.3109420

  10. Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning, vol. 1 (2009). https://doi.org/10.1007/b94608

  11. Macqueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, no. 233, pp. 281–297 (1967)

    Google Scholar 

  12. Donath, W.E., Hoffman, A.J.: Lower bounds for the partitioning of graphs. IBM J. Res. Dev. 17(5), 420–425 (1973). https://doi.org/10.1147/rd.175.0420

    Article  MathSciNet  MATH  Google Scholar 

  13. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002). https://doi.org/10.1073/pnas.122653799

    Article  MathSciNet  MATH  Google Scholar 

  14. Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 10, 2008 (2008). https://doi.org/10.1088/1742-5468/2008/10/P10008

    Article  Google Scholar 

  15. Guimerà, R., Sales-Pardo, M., Amaral, L.A.N.: Modularity from fluctuations in random graphs and complex networks. Phys. Rev. E. - Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top. 70(2), 4 (2004). https://doi.org/10.1103/physreve.70.025101

    Article  Google Scholar 

  16. Santucci, V., Baioletti, M., Milani, A.: An algebraic differential evolution for the linear ordering problem. In: Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference - GECCO Companion 2015, pp. 1479–1480 (2015). https://doi.org/10.1145/2739482.2764693

  17. Baioletti, M., Milani, A., Santucci, V.: An extension of algebraic differential evolution for the linear ordering problem with cumulative costs. In: Handl, J., Hart, E., Lewis, P.R., López-Ibáñez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 123–133. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45823-6_12

    Chapter  Google Scholar 

  18. Castellano, C., Cecconi, F., Loreto, V., Parisi, D., Radicchi, F.: Self-contained algorithms to detect communities in networks. Eur. Phys. J. B 38(2), 311–319 (2004). https://doi.org/10.1140/epjb/e2004-00123-0

    Article  Google Scholar 

  19. Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Phys. Rev. E 74(1), 16110 (2006). https://doi.org/10.1103/PhysRevE.74.016110

    Article  MathSciNet  Google Scholar 

  20. Reichardt, J., White, D.R.: Role models for complex networks. Eur. Phys. J. B 60(2), 217–224 (2007). https://doi.org/10.1140/epjb/e2007-00340-y

    Article  MATH  Google Scholar 

  21. Dawson, S., Bakharia, A., Heathcote, E.: SNAPP : realising the affordances of real-time SNA within networked learning environments. In: Proceedings of the 7th International Conference on Networked Learning, pp. 125–133 (2010)

    Google Scholar 

  22. Bakharia, A., Dawson, S.: SNAPP. In: Proceedings of the 1st International Conference on Learning Analytics and Knowledge - LAK 2011, p. 168 (2011). https://doi.org/10.1145/2090116.2090144

  23. Sheard, J., Ceddia, J., Hurst, J., Tuovinen, J.: Inferring student learning behaviour from website interactions: a usage analysis. Educ. Inf. Technol. 8(2002), 245–266 (2003). https://doi.org/10.1023/A:1026360026073

    Article  Google Scholar 

  24. Tasso, S., Pallottelli, S., Laganà, A.: Mobile device access to collaborative distributed repositories of chemistry learning objects. In: Gervasi, O., Murgante, B., Misra, S., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O., Stankova, E., Wang, S. (eds.) ICCSA 2016. LNCS, vol. 9786, pp. 443–454. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42085-1_34

    Chapter  Google Scholar 

  25. Tasso, S., Pallottelli, S., Ciavi, G., Bastianini, R., Laganà, A.: An efficient taxonomy assistant for a federation of science distributed repositories: a chemistry use case. In: Murgante, B., Misra, S., Carlini, M., Torre, C.M., Nguyen, H.-Q., Taniar, D., Apduhan, B.O., Gervasi, O. (eds.) ICCSA 2013. LNCS, vol. 7971, pp. 96–109. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39637-3_8

    Chapter  Google Scholar 

  26. Nguyen, Q., Huptych, M., Rienties, B.: Linking students’ timing of engagement to learning design and academic performance : a longitudinal study. In: Proceedings of the 8th International Conference on Learning Analytics and Knowledge, pp. 141–150 (2018). https://doi.org/10.1145/3170358.3170398

  27. Boroujeni, M.S., Dillenbourg, P.: Discovery and temporal analysis of latent study patterns from MOOC interaction sequences. In: Proceedings of the Eighth International Conference on Learning Analytics and Knowledge, pp. 206–215 (2018). https://doi.org/10.1145/3170358.3170388

  28. Khosravi, H., Cooper, K.M.L.: Using learning analytics to investigate patterns of performance and engagement in large classes. In: Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education – SIGCSE 2017, pp. 309–314 (2017). https://doi.org/10.1145/3017680.3017711

  29. Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973). https://doi.org/10.1145/362342.362367

    Article  MATH  Google Scholar 

  30. Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Netw. 5(2), 109–137 (1983). https://doi.org/10.1016/0378-8733(83)90021-7

    Article  MathSciNet  Google Scholar 

  31. Bailly-Bechet, M., et al.: Finding undetected protein associations in cell signaling by belief propagation. Proc. Natl. Acad. Sci. 108(2), 882–887 (2011). https://doi.org/10.1073/pnas.1004751108

    Article  Google Scholar 

  32. Peixoto, T.P.: Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models. Phys. Rev. E - Stat. Nonlinear Soft Matter Phys. 89(1), 018204 (2014). https://doi.org/10.1103/physreve.89.012804

    Article  Google Scholar 

  33. Brandes, U., et al.: Maximizing modularity is hard, no. 1907 (2006)

    Google Scholar 

  34. Mengoni, P., Milani, A., Li, Y.: Clustering students interactions in eLearning systems for group elicitation. In: Gervasi, O., et al. (eds.) ICCSA 2018, LNCS, vol. 10962, pp. xx–yy (2018)

    Google Scholar 

  35. Rosenberg, A., Hirschberg, J.: V-measure: a conditional entropy-based external cluster evaluation measure. In: Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, vol. 1, no. June, pp. 410–420 (2007). https://doi.org/10.7916/d80v8n84

  36. Van Rijsbergen, C.J.: Information Retrieval. Inf. Retr. Boston, 208 (1979). https://doi.org/10.1007/springerreference_16360

Download references

Acknowledgements

This work was partially supported by University of Perugia “Fondi Ricerca di Base 2015” project “Distributed algorithms for node ranking in complex and scale free network.”

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Florence, Florence, Italy

    Paolo Mengoni

  2. Department of Mathematics and Computer Science, University of Perugia, Perugia, Italy

    Alfredo Milani

  3. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Alfredo Milani & Yuanxi Li

Authors
  1. Paolo Mengoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alfredo Milani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuanxi Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paolo Mengoni .

Editor information

Editors and Affiliations

  1. University of Perugia, Perugia, Italy

    Osvaldo Gervasi

  2. University of Basilicata, Potenza, Italy

    Beniamino Murgante

  3. Covenant University, Ota, Nigeria

    Sanjay Misra

  4. Saint Petersburg State University, Saint Petersburg, Russia

    Elena Stankova

  5. Polytechnic University of Bari, Bari, Italy

    Carmelo M. Torre

  6. University of Minho, Braga, Portugal

    Ana Maria A.C. Rocha

  7. Monash University, Clayton, Victoria, Australia

    David Taniar

  8. Kyushu Sangyo University, Fukuoka shi, Fukuoka, Japan

    Bernady O. Apduhan

  9. Politecnico di Bari, Bari, Italy

    Eufemia Tarantino

  10. Myongji University, Yongin, Korea (Republic of)

    Yeonseung Ryu

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mengoni, P., Milani, A., Li, Y. (2018). Community Graph Elicitation from Students’ Interactions in Virtual Learning Environments. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2018. ICCSA 2018. Lecture Notes in Computer Science(), vol 10962. Springer, Cham. https://doi.org/10.1007/978-3-319-95168-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-95168-3_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-95167-6

  • Online ISBN: 978-3-319-95168-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation