Cubic analysis of social bookmarking for personalized recommendation

APWeb(2006)

引用 63|浏览0
暂无评分
摘要
Personalized recommendation is used to conquer the information overload problem, and collaborative filtering recommendation (CF) is one of the most successful recommendation techniques to date. However, CF becomes less effective when users have multiple interests, because users have similar taste in one aspect may behave quite different in other aspects. Information got from social bookmarking websites not only tells what a user likes, but also why he or she likes it. This paper proposes a division algorithm and a CubeSVD algorithm to analysis this information, distill the interrelations between different users’ various interests, and make better personalized recommendation based on them. Experiment reveals the superiority of our method over traditional CF methods.
更多
查看译文
关键词
division algorithm,cubesvd algorithm,personalized recommendation,multiple interest,successful recommendation technique,similar taste,different user,information overload problem,cubic analysis,traditional cf method,social bookmarking web,collaborative filtering,information overload
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要