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.
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篇论文的施引文献,订阅后可以查看论文全部施引文献