Abstract
Massive open online courses (MOOCs) provide an opportunity for learners to access free courses offered by top universities in the world. However, with contrast to large scale enrollment, the completion rate of these courses is really low. One of the reasons for students to quit learning process is that they could not study the courses with their friends. In order to improve the completion rate, we address the importance of content interest and social friendship for courses arrangement for learners in MOOCs. We first develop a greedy algorithm to solve the arrangement according to the friendship of learners and the content of courses. Then we used the game theoretic framework to improve greedy algorithm performance. Finally, we verify the effectiveness and efficiency of the proposed solutions through extensive experiments on both real and synthetic datasets.
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
References
Hollands, F.M., Tirthali, D.: MOOCs: expectations and reality. Full Report (2014, online submission)
Vaquero, L., Cebrian, M.: The rich club phenomenon in the classroom. Sci. Rep. 3 (2013). Article ID 1174
Liu, X., He, Q., Tian, Y., Lee, W., McPherson, J., Han, J.: Event-based social networks: linking the online and offline social worlds. In: SIGKDD, pp. 1032–1040 (2012)
Zhuhadar, L., Butterfield, J.: Analyzing students logs in open online courses using SNA techniques. In: Proceedings of AMCIS (2014)
Yang, D., Wen, M., Rose, C.: Peer influence on attrition in massively open online courses. In: Educational Data Mining 2014 (2014)
She, J., Tong, Y., Chen, L.: Utility-aware event-participant planning. In: SIGMOD, pp. 1617–1628 (2015)
She, J., Tong, Y., Chen, L., Cao, C.: Conflict-aware event-participant arrangement and its variant for online setting. IEEE Trans. Knowl. Data Eng. 28(9), 2281–2295 (2016)
Tong, Y., She, J., Ding, B., Wang, L., Chen, L.: Online mobile micro-task allocation in spatial crowdsourcing. In: ICDE, pp. 49–60 (2016)
Tong, Y., She, J., Ding, B., Wang, L., Chen, L., Wo, T., Xu, K.: Online minimum matching in real-time spatial data: experiments and analysis. Proc. VLDB Endow. 9(12), 1053–1064 (2016)
Tong, Y., She, J., Meng, R.: Bottleneck-aware arrangement over event-based social networks: the max-min approach. World Wide Web J. 19(6), 1151–1177 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Liang, Y. (2017). Social Friendship-Aware Courses Arrangement on MOOCs. In: Bao, Z., Trajcevski, G., Chang, L., Hua, W. (eds) Database Systems for Advanced Applications. DASFAA 2017. Lecture Notes in Computer Science(), vol 10179. Springer, Cham. https://doi.org/10.1007/978-3-319-55705-2_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-55705-2_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55704-5
Online ISBN: 978-3-319-55705-2
eBook Packages: Computer ScienceComputer Science (R0)