一种新颖的协同推荐算法研究

为了克服协同推荐系统中的用户评分数据稀疏性和推荐实时性差的问题,提出了一种高效的基于粗集的个性化推荐算法.该算法首先利用维数简化技术对评分矩阵进行优化,然后采用分类近似质量计算用户间的相似性形成最近邻居,从而降低数据稀疏性和提高最近邻寻找准确性.实验结果表明,该算法有效地解决用户评分数据极端稀疏情况下传统相似性度量方法存在的问题,显著地提高推荐系统的推荐质量.

A New Collaborative Recommendation Algorithm Research

In order to overcome the problem of traditional collaborative filtering algorithm faces severe challenge of sparse user ratings and real——time recommendation,a high efficient personalization recommendation algorithm based on rough set is proposed.The algorithm refine the user ratings data using dimensionality reduction,then uses the quality of approximation of classification to find the target users’neighbors.Thus the sparsity can be decreased and the accuracy of searching nearest neighbor can be improved.The experimental results show that this method can efficiently improve the extreme sparsity of user rating data,and provide better recommendation results than traditional collaborative filtering algorithms.