Improvement of Adaptive Learning Service Recommendation Algorithm Based on Big Data

19Citations
Citations of this article
50Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In view of the problem that the traditional learning service recommendation does not fully consider the distinct differences between individuals, it is easy to lead to the contradiction between unchanging learning resources and learners’ personalized learning needs that are constantly improving, so an adaptive learning service recommendation improvement algorithm based on big data is proposed. Idea is based on adaptive learning platform and function modules. We consider the individual differences between students, to students as the center, collect students’ personalized learning demand data, and according to the data information to build student demand model. On the basis of using data mining methods for clustering recommendation service resources in learning, the adaptive recommend according to students’ individual need is proposed. The experimental results show that the adaptive learning service recommendation algorithm based on big data has high recommendation accuracy, coverage rate and recall rate, which is of great significance in the actual learning service recommendation.

Cite

CITATION STYLE

APA

Yang, Y. zhi, Zhong, Y., & Woźniak, M. (2021). Improvement of Adaptive Learning Service Recommendation Algorithm Based on Big Data. Mobile Networks and Applications, 26(5), 2176–2187. https://doi.org/10.1007/s11036-021-01772-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free