Research and Application of Algorithm Based on Maximum Expectation and Collaborative Filtering In Recommended System

Author:

Fan Ying,Ma Huan,Chen Zhongyang,Shen Keli

Abstract

Abstract The problem of sparse information is easily found in information searching for new users in recommended system, and it also has difficulty in recommending related modules. In view of the problem, the maximum expectation algorithm in demographics is adopted to cluster users for neighbouring users, and then it is regarded as an input of collaborative filtering algorithm. As the users’ scores on different projects represent their preference, certain demand relevance exists in similar users when evaluating the same project. And this kind of relevance degree varies with the change of individual demand. Therefore, a cooperative filtering algorithm based on the change of user’ demand is put forward by introducing a time weight function, which alleviates the shortness of traditional cooperative filtering recommendation algorithm. By tracking the needs of users, the scoring matrix can be predicted. According to experiments comparison, this algorithm can help solve the problem of sparseness of user’s scoring matrix and the recommendation quality is improved.

Publisher

IOP Publishing

Subject

General Physics and Astronomy

Reference24 articles.

1. A system for sharing recommendations;Tevreen;Communications of the ACM,1997

2. Algorithms for automating “ word of mouth”;Shardanand,1995

3. Personalized navigation for the Web;Rucker;Communications of the ACM,1997

4. A collaborative web browsing agent;Lieberman,1999

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3