基于精确欧氏局部敏感哈希的协同过滤推荐算法

计算机应用 ›› 2014, Vol. 34 ›› Issue (12): 3481-3486.

基于精确欧氏局部敏感哈希的协同过滤推荐算法

李红梅,郝文宁,陈刚

解放军理工大学指挥信息系统学院,南京 210007

收稿日期:2014-05-19 修回日期:2014-07-04 出版日期:2014-12-01 发布日期:2014-12-31
通讯作者: 李红梅
作者简介:李红梅(1990-）,女,河北衡水人,硕士研究生,主要研究方向:中文信息检索、数据挖掘；郝文宁(1971-）,男,山西运城人,教授,博士,主要研究方向:海量高维数据归约、作战效能评估；陈刚(1974-）,男,重庆人,副教授,硕士,主要研究方向:作战指挥训练模拟。

Collaborative filtering recommendation algorithm based on exact Euclidean locality-sensitive hashing

LI Hongmei,HE Wenning,CHEN Gang

College of Command and Information System, PLA University of Science and Technology, Nanjing Jiangsu 210007, China

Received:2014-05-19 Revised:2014-07-04 Online:2014-12-01 Published:2014-12-31
Contact: LI Hongmei

摘要/Abstract

摘要：

针对推荐系统中用户评分数据的海量高维与稀疏性,以及直接利用传统相似性度量方法来获取近邻的计算量大、结果不准等对推荐质量的影响,提出基于精确欧氏局部敏感哈希(E2LSH)的协同过滤推荐算法。首先利用精确欧氏局部敏感哈希算法对用户评分数据进行降维处理并构建索引,以快速获取目标用户的近邻用户；然后利用加权策略来预测用户评分,进而完成协同过滤推荐。实验结果表明,该算法能有效解决用户数据的海量高维与稀疏性问题,且运行效率高,具有较好的推荐质量。

Abstract:

In recommendation systems, recommendation results are affected by the matter that rating data is characterized by large volume, high dimensionality, extreme sparsity, and the limitation of traditional similarity measuring methods in finding the nearest neighbors, including huge calculation and inaccurate results. Aiming at the poor recommendation quality, this paper presented a new collaborative filtering recommendation algorithm based on Exact Euclidean Locality-Sensitive Hashing (E2LSH). Firstly, E2LSH algorithm was utilized to lower dimensionality and construct index for large rating data. Based on the index, the nearest neighbor users of target user could be obtained with great efficiency. Then, a weighted strategy was applied to predict the user ratings to perform collaborative filtering recommendation. The experimental results on typical dataset show that the proposed method can overcome the bottleneck of high dimensionality and sparsity to some degree, with high running efficiency and good recommendation performance.

中图分类号:

TP391.3

李红梅郝文宁陈刚. 基于精确欧氏局部敏感哈希的协同过滤推荐算法[J]. 计算机应用, 2014, 34(12): 3481-3486.

LI Hongmei HE Wenning CHEN Gang. Collaborative filtering recommendation algorithm based on exact Euclidean locality-sensitive hashing[J]. Journal of Computer Applications, 2014, 34(12): 3481-3486.

参考文献

［1］BREESE J, HECHERMAN D, KADIE C. Empirical analysis of predictive algorithms for collaborative filtering［C］// Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence. San Francisco: Morgan Kaufmann Publishers, 1998: 43-52.
［2］ZHANG S, WANG W, FORD J, et al. Learning from incomplete ratings using non-negative matrix factorization［C］// Proceedings of the 6th SIAM Conference on Data Mining. Philadelphia: SIAM, 2006: 549-553.
［3］WANG S, XIE Y, FANG M. A collaborative filtering recommendation algorithm based on item and cloud model［J］. Wuhan University Journal of Natural Sciences, 2011, 16(1): 16-20.
［4］WU H, WANG Y, WANG Z, et al. Two-phase collaborative filtering algorithm based on co-clustering［J］. Journal of Software, 2010, 21(5): 1042-1054.(吴湖, 王永吉, 王哲, 等. 两阶段联合聚类的协同过滤算法［J］. 软件学报, 2011, 21(5): 1042-1054.)
［5］LI K, LING X. Personal recommendation based on cloud model and user clustering［J］. Journal of Computer Applications, 2013, 33(10): 2804-2806.(李克潮, 凌霄娥. 云模型与用户聚类的个性化推荐［J］. 计算机应用, 2013, 33(10): 2804-2806.)
［6］ZENG X, WEI Z, JIN Z. Research of matrix sparsity for collaborative filtering［J］. Journal of Computer Applications, 2010, 30(4): 1079-1082.(曾小波, 魏祖宽, 金在弘. 协同过滤系统的矩阵稀疏性问题的研究［J］. 计算机应用, 2010, 30(4): 1079-1082.)
［7］FANG Y, GUO Y, DING X, et al. An improved singular value decomposition recommender algorithm based on local structures［J］. Journal of Electronic and Information Technology, 2013, 35(6): 1284-1289. (方耀宁, 郭云飞, 丁雪涛, 等. 一种基于局部结构的改进奇异值分解推荐算法［J］. 电子与信息学报, 2013, 35(6): 1284-1289.)
［8］CAI R, ZHANG C, ZHANG L, et al. Scalable Music recommendation by search［C］// Proceedings of the 15th ACM International Conference on Multimedia. New York: ACM, 2007: 1065-1074.
［9］DATAR M, IMMORLICA N, INDYK P, et al. Locality-sensitive hashing scheme based on p-stable distributions［C］// Proceedings of the 20th ACM Symposium on Computational Geometry. New York: ACM, 2004: 253-262.
［10］MAREE R, DENIS P, WEHENKEL L. Incremental indexing and distributed image search using shared randomized vocabularies［C］// Proceedings of the 2007 ACM SIGMM International Conference on Very Large Data Bases. New York: ACM, 2007: 950-961.
［11］ANDONI A, INDYK P. Nearest-optimal hashing algorithms for approximate nearest neighbor in high dimensions［J］. Communications of the ACM, 2008,51(1): 117-122.
［12］ANDONI A, INDYK P. E2LSH: Exact Euclidean Locality-Sensitive Hashing (E2LSH) 0.1 user manual［EB/OL］. ［2005-06-01］. http://www.mit.edu/~ andoni/ LSH/manual.pdf.
［13］MALCOLM S, MICHAEL C. Locality-sensitive hashing for finding nearest neighbors ［J］. IEEE Signal Processing Magazine, 2008, 8(3): 128-131.
［14］GAO H, PENG T, LI B, et al. A fast retrieval method based on frequent items voting of multi table and bucket map chain［J］. Journal of Electronic and Information Technology, 2012, 34(11): 2574-2581. (高毫林, 彭天强, 李弼程, 等. 基于多表频繁项投票和桶映射链的快速检索方法［J］. 电子与信息学报, 2012, 34(11): 2574-2581.)
［15］GAO H, PENG T, LI B, et al. Approximate nearest neighbor searching algorithm-locality sensitive hashing［J］. Journal of Information Engineering University, 2013, 14(3): 332-340.(高毫林, 彭天强, 李弼程, 等. 近似最近邻搜索算法——位置敏感哈希［J］. 信息工程大学学报, 2013, 14(3): 332-340.)

[1]	陈宪聪潘微科明仲. 面向异构单类协同过滤的阶段式变分自编码器[J]. 计算机应用, 0, (): 0-0.
[2]	孙蕊, 韩萌, 张春砚, 申明尧, 杜诗语. 含负项top-k高效用项集挖掘算法[J]. 计算机应用, 2021, 41(8): 2386-2395.
[3]	包玄, 陈红梅, 肖清. 融入时间的兴趣点协同推荐算法[J]. 计算机应用, 2021, 41(8): 2406-2411.
[4]	刘芳名, 张鸿. 基于多级语义的判别式跨模态哈希检索算法[J]. 计算机应用, 2021, 41(8): 2187-2192.
[5]	陈立潮, 张雷, 曹建芳, 张睿. 梯度直方图卷积特征的胶囊网络在交通监控下的车型分类[J]. 计算机应用, 2020, 40(10): 2881-2889.
[6]	李寒露, 解庆, 唐伶俐, 刘永坚. 融合时空信息和兴趣点重要性的POI推荐算法[J]. 计算机应用, 2020, 40(9): 2600-2605.
[7]	李春英, 汤庸, 肖政宏, 李天送. 学术社交网络中的权威学者推荐模型[J]. 计算机应用, 2020, 40(9): 2594-2599.
[8]	王留洋, 俞扬信, 陈伯伦, 章慧. 基于共识和分类改善文档聚类的识别信息方法[J]. 计算机应用, 2020, 40(4): 1069-1073.
[9]	陈立潮, 郑佳敏, 曹建芳, 潘理虎, 张睿. 基于胶囊网络的智能交通标志识别方法[J]. 计算机应用, 2020, 40(4): 1045-1049.
[10]	秦品乐, 李鹏波, 曾建潮, 朱辉, 徐少伟. 基于级联全卷积神经网络的颈部淋巴结自动识别算法[J]. 计算机应用, 2019, 39(10): 2915-2922.
[11]	秦品乐, 李启, 曾建潮, 张娜, 宋宇龙. 基于多尺度密集网络的肺结节图像检索算法[J]. 计算机应用, 2019, 39(2): 392-397.
[12]	秦品乐李启曾建潮张娜宋宇龙. 基于多尺度密集网络的肺结节图像检索算法研究[J]. 计算机应用, 0, (): 0-0.
[13]	代刚, 张鸿. 基于语义相关性与拓扑关系的跨媒体检索算法[J]. 计算机应用, 2018, 38(9): 2529-2534.
[14]	周玉江王娟林晓辉. 度相关性可调的社交网络增长演化模型[J]. 计算机应用, 0, (): 0-0.
[15]	胡敏陈元会黄宏程. LBSN中基于时空关系的超网络链接预测方法[J]. 计算机应用, 0, (): 0-0.