首页 | 官方网站   微博 | 高级检索  
     

随机低秩逼近算法在推荐系统中的应用
引用本文:陈熙,邓杰臣,席势鸿,刘晓辰,张相君,冯月华.随机低秩逼近算法在推荐系统中的应用[J].上海工程技术大学学报,2021,35(3):281-284.
作者姓名:陈熙  邓杰臣  席势鸿  刘晓辰  张相君  冯月华
作者单位:a.上海工程技术大学 机械与汽车工程学院b.航空运输学院(飞行学院);c.数理与统计学院,上海 201620
基金项目:上海工程技术大学大学生创新训练计划资助项目(CX2021008)
摘    要:针对推荐系统中数据量越来越大,其对应的矩阵填充问题算法效率有待提升. 基于随机算法策略以及高效数据访问要求,提出一种新的求解矩阵填充问题的算法,并借助Matlab软件实现该算法. 数值试验结果表明,该算法在效率上可提升30%左右.

关 键 词:奇异值分解    随机算法    低秩逼近    推荐系统
收稿时间:2021-03-06

Application of randomized low-rank approximation algorithm in recommendation system
CHEN Xi,DENG Jiechen,XI Shihong,LIU Xiaochen,ZHANG Xiangjun,FENG Yuehua.Application of randomized low-rank approximation algorithm in recommendation system[J].Journal of Shanghai University of Engineering Science,2021,35(3):281-284.
Authors:CHEN Xi  DENG Jiechen  XI Shihong  LIU Xiaochen  ZHANG Xiangjun  FENG Yuehua
Affiliation:a.School of Mechanical and Automotive Engineeringb.School of Air Transportation and School of Flyingc.School of Mathematics, Physics and Statistics, Shanghai University of Engineering Science, Shanghai 201620, China
Abstract:In view of the problem that with increasing large amount of datas in a recommendation system, the computing efficiency of its corresponding matrix completion algorithms need to be improved. Based on randomized algorithm strategy and efficient data access requirements, a new algorithm for solving matrix completion problem was proposed, and the Matlab software was employed to realize the algorithm. The numerical experiment result shows that the new algorithm can speed up the computing efficiency of original one by about 30%.
Keywords:
点击此处可从《上海工程技术大学学报》浏览原始摘要信息
点击此处可从《上海工程技术大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号