A learning resource recommendation algorithm based on online learning sequential behavior

Author(s):  
Xuebin Wang ◽  
Zhengzhou Zhu ◽  
Jiaqi Yu ◽  
Ruofei Zhu ◽  
DeQi Li ◽  
...  

The accuracy of learning resource recommendation is crucial to realizing precise teaching and personalized learning. We propose a novel collaborative filtering recommendation algorithm based on the student’s online learning sequential behavior to improve the accuracy of learning resources recommendation. First, we extract the student’s learning events from his/her online learning process. Then each student’s learning events are selected as the basic analysis unit to extract the feature sequential behavior sequence that represents the student’s learning behavioral characteristics. Then the extracted feature sequential behavior sequence generates the student’s feature vector. Moreover, we improve the H-[Formula: see text] clustering algorithm that clusters the students who have similar learning behavior. Finally, we recommend learning resources to the students combine similarity user clusters with the traditional collaborative filtering algorithm based on user. The experiment shows that the proposed algorithm improved the accuracy rate by 110% and recall rate by 40% compared with the traditional user-based collaborative filtering algorithm.

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Kunni Han

Faced with massive amounts of online news, it is often difficult for the public to quickly locate the news they are interested in. The personalized recommendation technology can dig out the user’s interest points according to the user’s behavior habits, thereby recommending the news that may be of interest to the user. In this paper, improvements are made to the data preprocessing stage and the nearest neighbor collection stage of the collaborative filtering algorithm. In the data preprocessing stage, the user-item rating matrix is filled to alleviate its sparsity. The label factor and time factor are introduced to make the constructed user preference model have a better expression effect. In the stage of finding the nearest neighbor set, the collaborative filtering algorithm is combined with the dichotomous K-means algorithm, the user cluster matching the target user is selected as the search range of the nearest neighbor set, and the similarity measurement formula is improved. In order to verify the effectiveness of the algorithm proposed in this paper, this paper selects a simulated data set to test the performance of the proposed algorithm in terms of the average absolute error of recommendation, recommendation accuracy, and recall rate and compares it with the user-based collaborative filtering recommendation algorithm. In the simulation data set, the algorithm in this paper is superior to the traditional algorithm in most users. The algorithm in this paper decomposes the sparse matrix to reduce the impact of data sparsity on the traditional recommendation algorithm, thereby improving the recommendation accuracy and recall rate of the recommendation algorithm and reducing the recommendation error.


2020 ◽  
Vol 214 ◽  
pp. 01051
Author(s):  
Baiqiang Gan ◽  
Chi Zhang

In recent years, under the guidance of the educational concept of equality and sharing, universities at home and abroad have increased the development and application of online course learning resources. In China, online open courses are open to all learners on the platform of major portals. Due to the increasing number of online courses, it is increasingly difficult for learners to find the content they are interested in on the website. In addition, the traditional collaborative filtering has the problems of sparse data, cold start, and low accuracy of recommendation results, etc. Therefore, the personalized recommendation system studied in this paper adds the collaborative filtering recommendation technology of user and project attributes. The recommendation system can actively discover the interest of learners according to their behavior characteristics, and provide them with online learning resources of interest, and improve the accuracy of the recommendation results by improving the collaborative filtering algorithm. In this paper, personalized recommendation technology is applied to online course website, aiming at providing personalized, automated and intelligent recommendation system for online learners.


Author(s):  
Mingxia Zhong ◽  
Rongtao Ding

At present, personalized recommendation system has become an indispensable technology in the fields of e-commerce, social network and news recommendation. However, the development of personalized recommendation system in the field of education and teaching is relatively slow with lack of corresponding application.In the era of Internet Plus, many colleges have adopted online learning platforms amidst the coronavirus (COVID-19) epidemic. Overwhelmed with online learning tasks, many college students are overload by learning resources and unable to keep orientation in learning. It is difficult for them to access interested learning resources accurately and efficiently. Therefore, the personalized recommendation of learning resources has become a research hotspot. This paper focuses on how to develop an effective personalized recommendation system for teaching resources and improve the accuracy of recommendation. Based on the data on learning behaviors of the online learning platform of our university, the authors explored the classic cold start problem of the popular collaborative filtering algorithm, and improved the algorithm based on the data features of the platform. Specifically, the data on learning behaviors were extracted and screened by knowledge graph. The screened data were combined with the collaborative filtering algorithm to recommend learning resources. Experimental results show that the improved algorithm effectively solved the loss of orientation in learning, and the similarity and accuracy of recommended learning resources surpassed 90%. Our algorithm can fully satisfy the personalized needs of students, and provide a reference solution to the personalized education service of intelligent online learning platforms.


Author(s):  
Gang Huang ◽  
Man Yuan ◽  
Chun-Sheng Li ◽  
Yong-he Wei

Firstly, this paper designs the process of personalized recommendation method based on knowledge graph, and constructs user interest model. Second, the traditional personalized recommendation algorithms are studied and their advantages and disadvantages are analyzed. Finally, this paper focuses on the combination of knowledge graph and collaborative filtering recommendation algorithm. They are effective to solve the problem where [Formula: see text] value is difficult to be determined in the clustering process of traditional collaborative filtering recommendation algorithm as well as data sparsity and cold start, utilizing the ample semantic relation in knowledge graph. If we use RDF data, which is distributed by the E and P (Exploration and Development) database based on the petroleum E and P, to verify the validity of the algorithm, the result shows that collaborative filtering algorithm based on knowledge graph can build the users’ potential intentions by knowledge graph. It is enlightening to query the information of users. In this way, it expands the mind of users to accomplish the goal of recommendation. In this paper, a collaborative filtering algorithm based on domain knowledge atlas is proposed. By using knowledge graph to effectively classify and describe domain knowledge, the problems are solved including clustering and the cold start in traditional collaborative filtering recommendation algorithm. The better recommendation effect has been achieved.


2018 ◽  
Vol 173 ◽  
pp. 03067
Author(s):  
Qing Yang ◽  
Peiling Yuan ◽  
Xi Zhu

This paper presents a personalized course recommended algorithm based on the hybrid recommendation. The recommendation algorithm uses the improved NewApriori algorithm to implements the association rule recommendation, and the user-based collaborative filtering algorithm is the main part of the algorithm. The hybrid algorithm adds the weight to the recommendation result of the user-based collaborative filtering and association rule recommendation, implementing a hybrid recommendation algorithm based on both of them. It has solved the problem of data sparsity and cold-start partially and provides a academic reference for the design of high performance elective system. The experiment uses the student scores data of a college as the test set and analyzes results and recommended quality of personalized elective course. According to the results of the experimental results, the quality of the improved hybrid recommendation algorithm is better.


2010 ◽  
Vol 21 (10) ◽  
pp. 1217-1227 ◽  
Author(s):  
WEI ZENG ◽  
MING-SHENG SHANG ◽  
QIAN-MING ZHANG ◽  
LINYUAN LÜ ◽  
TAO ZHOU

Recommender systems are becoming a popular and important set of personalization techniques that assist individual users with navigating through the rapidly growing amount of information. A good recommender system should be able to not only find out the objects preferred by users, but also help users in discovering their personalized tastes. The former corresponds to high accuracy of the recommendation, while the latter to high diversity. A big challenge is to design an algorithm that provides both highly accurate and diverse recommendation. Traditional recommendation algorithms only take into account the contributions of similar users, thus, they tend to recommend popular items for users ignoring the diversity of recommendations. In this paper, we propose a recommendation algorithm by considering both the effects of similar and dissimilar users under the framework of collaborative filtering. Extensive analyses on three datasets, namely MovieLens, Netflix and Amazon, show that our method performs much better than the standard collaborative filtering algorithm for both accuracy and diversity.


2013 ◽  
Vol 411-414 ◽  
pp. 1044-1048
Author(s):  
Zhao Deng ◽  
Jin Wang

To overcome the uncertainty of the users neighborhoods in the recommendation algorithm of nearest neighbor, an improved collaborative filtering algorithm based on user clustering is proposed. This improved algorithm filters the users by their features, and the improved cosine similarity algorithm is used for the item similarity computation. Experiments on the MovieLens dataset showed that, compared with Lis collaborative filtering algorithm, the recommendation quality of the improved algorithm is more accurate and the category coverage is larger.


2021 ◽  
Vol 12 ◽  
Author(s):  
Xin Wei ◽  
Shiyun Sun ◽  
Dan Wu ◽  
Liang Zhou

The objective of the study is to explore an effective way for providing students with the appropriate learning resources in the remote education scenario. Artificial intelligence (AI) technology and educational psychology theory are applied for designing a personalized online learning resource recommendation scheme to improve students' learning outcomes. First, according to educational psychology, students' learning ability can be obtained by analyzing their learning behaviors. Their identities can be classified into three main groups. Then, features of learning resources such as difficulty degree are extracted, and a LinUCB-based learning resource recommendation algorithm is proposed. In this algorithm, a personalized exploration coefficient is carefully constructed according to student's ability and attention scores. It can adaptively adjust the ratio of exploration and exploitation during recommendation. Finally, experiments are conducted for evaluating the superior performance of the proposed scheme. The experimental results show that the proposed recommendation scheme can find appropriate learning resources which will match the student's ability and satisfy the student's personalized demands. Meanwhile, by comparing with existing state-of-the-art recommendation schemes, the proposed scheme can achieve accurate recommendations, so as to provide students with the most suitable online learning resources and reduce the risk brought by exploration. Therefore, the proposed scheme can not only control the difficulty degree of learning resources within the student's ability but also encourage their potential by providing suitable learning resources.


2014 ◽  
Vol 5 (1) ◽  
pp. 27-35
Author(s):  
Pengyuan Xu ◽  
Yanzhong Dang

The most crucial component of collaborative filtering recommendation algorithm (CF) is the mechanism of calculating similarities among items or users. In this paper, a new CF algorithm based on ItemRank Similarity (IRS) is proposed, which extracts items' quality characteristics from the similar matrix. The corresponding algorithmic accuracy is measured by the ranking score, precision, recall and F-measure. This algorithm provides remarkably higher accurate predictions than other modified CF algorithm.


2014 ◽  
Vol 513-517 ◽  
pp. 1878-1881
Author(s):  
Feng Ming Liu ◽  
Hai Xia Li ◽  
Peng Dong

The collaborative filtering recommendation algorithm based on user is becoming the more personalized recommendation algorithm. But when the user evaluation for goods is very small and the user didnt evaluate the item, the commodity recommendation based on the item evaluation of user may not be accurate, and this is the sparseness in the collaborative filtering algorithm based on user. In order to solve this problem, this paper presents a collaborative filtering recommendation algorithm based on user and item. The experimental results show that this method has smaller MAE and greatly improve the quality of the recommendation in the recommendation system.


Sign in / Sign up

Export Citation Format

Share Document