• •    

基于数据降维与精确欧式局部敏感哈希的k近邻推荐方法

郭喻栋,郭志刚,陈刚,魏晗   

  1. 解放军信息工程大学
  • 收稿日期:2017-03-22 修回日期:2017-05-22 发布日期:2017-05-22
  • 通讯作者: 郭志刚

Recommendation Method based on K Nearest Neighbors using Data Dimensionality Reduction and Exact Euclidean Locality-Sensitive Hashing

  • Received:2017-03-22 Revised:2017-05-22 Online:2017-05-22

摘要: 针对基于k近邻的协同过滤推荐算法中存在的评分特征数据维度过高,K近邻查找速度慢,以及评分冷启动等问题,提出基于数据降维与精确欧式局部敏感哈希的k近邻协同过滤推荐算法。首先,融合评分数据、用户属性数据以及项目类别数据,通过堆叠降噪自编码神经网络对这些数据进行非线性降维。然后,利用精确欧式局部敏感哈希算法对降维后的数据建立索引,通过检索得到目标用户或目标项目的相似近邻。最后,计算目标与相邻之间的相似度,利用相似度对评分记录加权得到目标用户对目标项目的预测评分。在标准数据集上的实验结果表明,本文方法提高了推荐准确率和推荐效率,在冷启动场景下,较于同类其他方法准确率最高。

关键词: 信息推荐, 堆叠降噪自编码器, 精确欧式局部敏感哈希, 数据降维, 冷启动

Abstract: There are several problems in the domain of recommendation method based on k nearest neighbors, such as the high dimensionality of rating features, the slow speed of searching nearest neighbors and the cold start problem of ratings. To solve these problems, a recommendation method based on k nearest neighbors using data dimensionality reduction and Exact Euclidean Locality-Sensitive Hashing is proposed. Firstly, integrating the rating data, the user attribute data and the item category data, reduce the dimension of the data mentioned above using Stack Denoising Auto-encoder neutral network. Then, use the Exact Euclidean Local-Sensitive Hash algorithm to build the index of the reduced dimension data, and retrieve the target users or the target items to get their similar nearest neighbors. Finally, calculate the similarities between the target and the neighbors, and the target user’s similarity-weighted prediction rating for the target item is obtained. The experimental results on standard data sets show that the proposed method improves the accuracy and efficiency of recommendation, and it outperformed other similar method on precision in cold start scene.

Key words: information recommendation, Stack Denoising Auto-encoder, Exact Euclidean Locality-Sensitive Hashing, data dimensionality reduction, cold start

中图分类号: