{"title":"MOOCs video recommendation using low-rank and sparse matrix factorization with inter-entity relations and intra-entity affinity information","authors":"Yunmei Gao","doi":"10.1016/j.ipm.2024.103861","DOIUrl":null,"url":null,"abstract":"<div><h3>Purpose</h3><p>The serious information overload problem of MOOCs videos decreases the learning efficiency of the students and the utilization rate of the videos. There are two problems worthy of attention for the matrix factorization (MF)-based video learning resource recommender systems. Those methods suffer from the sparsity problem of the user-item rating matrix, while side information about user and item is seldom used to guide the learning procedure of the MF.</p></div><div><h3>Method</h3><p>To address those two problems, we proposed a new MOOCs video resource recommender LSMFERLI based on Low-rank and Sparse Matrix Factorization (LSMF) with the guidance of the inter-Entity Relations and intra-entity Latent Information of the students and videos. Firstly, we construct the inter-entity relation matrices and intra-entity latent preference matrix for the students. Secondly, we construct the inter-entity relation matrices and intra-entity affinity matrix for the videos. Lastly, with the guidance of the inter-entity relation and intra-entity affinity matrices of the students and videos, the student-video rating matrix is factorized into a low-rank matrix and a sparse matrix by the alternative iteration optimization scheme.</p></div><div><h3>Conclusions</h3><p>Experimental results on dataset MOOCcube indicate that LSMFERLI outperforms 7 state-of-the-art methods in terms of the HR@<em>K</em> and NDCG@<em>K</em>(<em>K</em> = 5,10,15) indicators increased by an average of 20.6 % and 21.0 %, respectively.</p></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":null,"pages":null},"PeriodicalIF":7.4000,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0306457324002206/pdfft?md5=308b736cfd63725fb5781fb48c9b85f3&pid=1-s2.0-S0306457324002206-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324002206","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Purpose
The serious information overload problem of MOOCs videos decreases the learning efficiency of the students and the utilization rate of the videos. There are two problems worthy of attention for the matrix factorization (MF)-based video learning resource recommender systems. Those methods suffer from the sparsity problem of the user-item rating matrix, while side information about user and item is seldom used to guide the learning procedure of the MF.
Method
To address those two problems, we proposed a new MOOCs video resource recommender LSMFERLI based on Low-rank and Sparse Matrix Factorization (LSMF) with the guidance of the inter-Entity Relations and intra-entity Latent Information of the students and videos. Firstly, we construct the inter-entity relation matrices and intra-entity latent preference matrix for the students. Secondly, we construct the inter-entity relation matrices and intra-entity affinity matrix for the videos. Lastly, with the guidance of the inter-entity relation and intra-entity affinity matrices of the students and videos, the student-video rating matrix is factorized into a low-rank matrix and a sparse matrix by the alternative iteration optimization scheme.
Conclusions
Experimental results on dataset MOOCcube indicate that LSMFERLI outperforms 7 state-of-the-art methods in terms of the HR@K and NDCG@K(K = 5,10,15) indicators increased by an average of 20.6 % and 21.0 %, respectively.
期刊介绍:
Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing.
We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.