Please wait a minute...
New Technology of Library and Information Service  2016, Vol. 32 Issue (4): 72-80    DOI: 10.11925/infotech.1003-3513.2016.04.09
Orginal Article Current Issue | Archive | Adv Search |
Collaborative Filtering Recommendation Method Based on User Learning Tree
Ma Li()
Education Technology & Lab Management Center, Tianjin Foreign Studies University, Tianjin 300204, China
Download: PDF(833 KB)   HTML ( 46
Export: BibTeX | EndNote (RIS)      

[Objective] This paper aims to improve traditionlal recommendation method and quality of E-Learning enviroment, which used attributes and access orders of resources in learning tree to predict learner’s rate. The collaborative filtering recommendation was then carried out through similar learner clustring. [Methods] First, “attributes of resources”“resource access order” “learning frequency and time” were standardized to construct users’ learning tree and then predict resouces rating. Second, learner’s similarity was calculated through Pearson and Cosine function respectivly based on predicted ratings. Third, K-means clustering method was used to group similar learners to establish collaborative filteing system for online E-learing. [Results] Compared with traditional collaborative filtering method, F-measure experimental result of the proposed method was 8.22% higher than the singular value decomposition CF and was 3.75% higher than the average score forecast CF. [Limitations] The proposed method was only tested on the dataset from one online learing platform with 52,456 students’ learning records and access logs. More research is needed to examine the method with other data sets. [Conclusions] The proposed collaborative filtering recommendation system does not rely on learners’ ratings and considers the influence of learners’ interest changes. It could help us deal with the starting and expanding issues.

Key wordsE-Learning recommendation      Collaborative Filtering      Learning tree      Study access sequence     
Received: 09 November 2015      Published: 13 May 2016

Cite this article:

Ma Li. Collaborative Filtering Recommendation Method Based on User Learning Tree. New Technology of Library and Information Service, 2016, 32(4): 72-80.

URL:     OR

[1] Verbert K, Manouselis N, Ochoa X, et al.Context-Aware Recommender Systems for Learning: A Survey and Future Challenges[J]. IEEE Transactions on Learning Technologies, 2012, 5(4): 318-335.
[2] Khribi M K, Jemni M, Nasraoui O.Automatic Recommendations for E-learning Personalization Based on Web Usage Mining Techniques and Information Retrieval[J]. Educational Technology and Society, 2009, 12(4): 30-42.
[3] Sharif N, Afzal M T, Helic D.A Framework for Resource Recommendations for Learners Using Social Bookmarking [C]. In: Proceedings of the 8th International Conference on Computing and Networking Technology. IEEE, 2012: 71-76.
[4] Salehi M, Kamalabadi I N, Ghoushchi M B G. Personalized Recommendation of Learning Material Using Sequential Pattern Mining and Attribute Based Collaborative Filtering[J]. Education and Information Technologies, 2014, 19(4): 713-735.
[5] Salehi M, Kamalabadi I N.Hybrid Recommendation Approach for Learning Material Based on Sequential Pattern of the Accessed Material and the Learner’s Preference Tree[J]. Knowledge-Based Systems, 2013, 48: 57-69.
[6] Chen W, Niu Z, Zhao X.A Hybrid Recommendation Algorithm Adapted in E-learning Environments[J]. 2014, 17(2): 271-284.
[7] Aher S B, Lobo L.Applicability of Data Mining Algorithms for Recommendation System in E-learning [C]. In: Proceedings of the International Conference on Advances in Computing, Communications and Informatics. 2012: 1034-1040.
[8] Salehi M, Kamalabadi I N, Attribute-based Recommender System for Learning Resource by Learner Preference Tree[C]. In: Proceedings of the 2nd International e-Conference on Computer and Knowledge Engineering. IEEE, 2012: 133-138.
[9] Ge L, Kong W, Luo J.Courseware Recommendation in E-learning System [C]. In: Proceedings of the 5th International Conference on Advances in Web Based Learning. 2006: 10-24.
[10] Wan L, Zhao C.A Hybrid Learning Object Recommendation Algorithm in E-learning Context[J]. International Journal of Digital Content Technology and Its Applications, 2012, 6(18): 442-448.
[11] Wang S, Xie Y, Fang M.A Collaborative Filtering Recommendation Algorithm Based on Item and Cloud Model[J]. Wuhan University Journal of Natural Sciences, 2011, 16(1): 16-20.
[12] Kim K, Ahn H.A Recommender System Using GA K-means Clustering in an Online Shopping Market[J]. Expert Systems with Applications, 2008, 34(2): 1200-1209.
[13] Jalali M, Mustapha N, Sulaiman M N B, et al. OPWUMP: An Architecture for Online Predicting in WUM-Based Personalization System [A]. // Advances in Computer Science and Engineering[M]. Springer Berlin Heidelberg, 2009.
[14] Albadvi A, Shahbazi M.Integrating Rating-based Collaborative Filtering with Customer Lifetime Value: New Product Recommendation Technique[J]. Intelligent Data Analysis, 2010, 14(1): 143-155.
[15] Nielsen J. The 90-9-1 Rule for Participation Inequality in Social Media and Online Communities [EB/OL]. [2015-09-01]. .
[16] Ebbinghaus H.Memory: A Contribution to Experimental Psychology[M]. New York: Dover, 1885.
[17] Devi M K K, Venkatesh P. Kernel Based Collaborative Recommender System for E-Purchasing[J]. Academy of Sciences, 2010, 35(5): 513-524.
[18] Kla?nja-Mili?evi? A, Vesin B, Ivanovic M, et al.E-learning Personalization Based on Hybrid Recommendation Strategy and Learning Style Identification[J]. Computers in Education, 2011, 56(3): 885-899.
[19] Sarwar B M, Karypis G, Konstan J A, et al.Application of Dimensionality Reduction in Recommender Systems [EB/ OL]. [2015-10-25]. .
[1] Jie Li,Fang Yang,Chenxi Xu. A Personalized Recommendation Algorithm with Temporal Dynamics and Sequential Patterns[J]. 数据分析与知识发现, 2018, 2(7): 72-80.
[2] Daoping Wang,Zhongyang Jiang,Boqing Zhang. Collaborative Filtering Algorithm Based on Gray Correlation Analysis and Time Factor[J]. 数据分析与知识发现, 2018, 2(6): 102-109.
[3] Yong Wang,Yongdong Wang,Huifang Guo,Yumin Zhou. Measuring Item Similarity Based on Increment of Diversity[J]. 数据分析与知识发现, 2018, 2(5): 70-76.
[4] Lingfeng Hua,Gaoming Yang,Xiujun Wang. Recommending Diversified News Based on User’s Locations[J]. 数据分析与知识发现, 2018, 2(5): 94-104.
[5] Fuliang Xue,Junling Liu. Improving Collaborative Filtering Recommendation Based on Trust Relationship Among Users[J]. 数据分析与知识发现, 2017, 1(7): 90-99.
[6] Xingxin Qin,Rongbo Wang,Xiaoxi Huang,Zhiqun Chen. Slope One Collaborative Filtering Algorithm Based on Multi-Weights[J]. 数据分析与知识发现, 2017, 1(6): 65-71.
[7] Li Daoguo,Li Lianjie,Shen Enping. New Collaborative Filtering Recommendation Algorithm Based on User Rating Time[J]. 现代图书情报技术, 2016, 32(9): 65-69.
[8] Tan Xueqing,Zhang Lei,Huang Cuicui,Luo Lin. A Collaborative Filtering and Recommendation Algorithm Using Trust of Domain-Experts and Similarity[J]. 现代图书情报技术, 2016, 32(7-8): 101-109.
[9] Wang Yong,Deng Jiangzhou,Deng Yongheng,Zhang Pu. A Collaborative Filtering Recommendation Algorithm Based on Item Probability Distribution[J]. 现代图书情报技术, 2016, 32(6): 73-79.
[10] Shuhao Jiang, Liyi Zhang, Zhixin Zhang. New Collaborative Filtering Algorithm Based on Relative Similarity[J]. 数据分析与知识发现, 2016, 32(12): 44-49.
[11] Wu Yingliang, Yao Huaidong, Li Cheng'an. An Improved Collaborative Filtering Recommendation Algorithm with Indirect Trust Relationship[J]. 现代图书情报技术, 2015, 31(9): 38-45.
[12] Zhu Ting, Qin Chunxiu, Li Zuhai. Research on Collaborative Filtering Personalized Recommendation Method Based on User Classification[J]. 现代图书情报技术, 2015, 31(6): 13-19.
[13] Gao Huming, Zhao Fengyue. A Hybrid Recommendation Method Combining Collaborative Filtering and Content Filtering[J]. 现代图书情报技术, 2015, 31(6): 20-26.
[14] Ying Yan, Cao Yan, Mu Xiangwei. A Hybrid Collaborative Filtering Recommender Based on Item Rating Prediction[J]. 现代图书情报技术, 2015, 31(6): 27-32.
[15] Jiang Shuhao, Pan Xuhua, Xue Fuliang. An Independent Recommendation Diversity Optimization Algorithm Based on Item Clustering[J]. 现代图书情报技术, 2015, 31(5): 34-41.
  Copyright © 2016 Data Analysis and Knowledge Discovery   Tel/Fax:(010)82626611-6626,82624938