基于用户行为特征的E2LSH动态权重混合推荐算法及应用
[Abstract]:In recent years, with the rapid rise of Internet services, users and the amount of information surge, and in these massive data how to accurately, quickly retrieve the data users need, It is an important research direction in the field of big data and data mining. In order to solve this problem, the recommendation system based on its intelligent search for user interest resources, subverts the traditional text retrieval methods, and provides a higher quality user experience. Although the recommendation system has greatly changed the way users obtain information, the traditional recommendation system will encounter problems such as "cold start" and "dimension disaster" in the face of massive sparse data of high dimension. These all put forward the huge challenge to the application of the recommendation system. In this paper, the current mainstream recommendation algorithms are summarized, and the similar nearest neighbor lookup, local sensitivity hashing and collaborative filtering are discussed. It is found that the accuracy of the recommendation algorithm in the face of sparse data has been reduced. At the same time, in the face of massive high dimensional data, the average time of the algorithm is too long. In order to solve these problems, this paper proposes the concepts of user behavior characteristics and dynamic weights, and combines E2LSH algorithm with hybrid recommendation algorithm to construct an accurate and efficient recommendation system. The main work of this paper is as follows: 1. Aiming at the problem of low recommendation accuracy in sparse data, a dynamic weighted hybrid recommendation algorithm based on user behavior feature is proposed in this paper. By preprocessing the data in the original data set, the personalized behavior feature index of different users for different items is calculated, and quantized into the user behavior feature vector, which is introduced into the calculation of similarity. The dynamic weight is calculated according to the individualized difference of user rating data sparsity, and the dynamic mixing of user content based recommendation algorithm and collaborative filtering recommendation algorithm is carried out. The experimental results show that compared with the traditional hybrid recommendation algorithm, the MAE of the proposed algorithm is 2.26% lower than that of the traditional hybrid recommendation algorithm, especially when the data set sparsity is extreme, the improvement of the recommendation effect is more significant. 2. Aiming at the effect of massive high dimensional data on the efficiency of hybrid recommendation algorithm, this paper studies the improved hybrid recommendation algorithm based on E2LSH. On the premise of keeping the similarity of data using E2LSH algorithm, the index of user-item is constructed when the system is offline. The time complexity of searching is reduced from O (N _ S _ 2) to O (1) when users need to search their nearest neighbors online, so as to improve the computing efficiency of filtering dissimilar users without changing the similarity of data. The experimental results show that the algorithm not only keeps the accuracy of the hybrid recommendation algorithm, but also greatly reduces the average computing time of the algorithm and greatly improves the overall calculation efficiency. The proposed hybrid recommendation algorithm based on E2LSH is applied to the cloud detection system of State Grid. When creating the task selection task counterpart, the system can intelligently recommend the appropriate field operator according to the historical information of the personnel, so as to eliminate the flow of manual screening by the user. It greatly improves the user's experience of using the system.
【学位授予单位】:武汉大学
【学位级别】:硕士
【学位授予年份】:2017
【分类号】:TP391.3
【相似文献】
相关期刊论文 前10条
1 徐义峰;徐云青;刘晓平;;一种基于时间序列性的推荐算法[J];计算机系统应用;2006年10期
2 余小鹏;;一种基于多层关联规则的推荐算法研究[J];计算机应用;2007年06期
3 张海玉;刘志都;杨彩;贾松浩;;基于页面聚类的推荐算法的改进[J];计算机应用与软件;2008年09期
4 张立燕;;一种基于用户事务模式的推荐算法[J];福建电脑;2009年03期
5 王晗;夏自谦;;基于蚁群算法和浏览路径的推荐算法研究[J];中国科技信息;2009年07期
6 周珊丹;周兴社;王海鹏;倪红波;张桂英;苗强;;智能博物馆环境下的个性化推荐算法[J];计算机工程与应用;2010年19期
7 王文;;个性化推荐算法研究[J];电脑知识与技术;2010年16期
8 张恺;秦亮曦;宁朝波;李文阁;;改进评价估计的混合推荐算法研究[J];微计算机信息;2010年36期
9 夏秀峰;代沁;丛丽晖;;用户显意识下的多重态度个性化推荐算法[J];计算机工程与应用;2011年16期
10 杨博;赵鹏飞;;推荐算法综述[J];山西大学学报(自然科学版);2011年03期
相关会议论文 前10条
1 王韬丞;罗喜军;杜小勇;;基于层次的推荐:一种新的个性化推荐算法[A];第二十四届中国数据库学术会议论文集(技术报告篇)[C];2007年
2 唐灿;;基于模糊用户心理模式的个性化推荐算法[A];2008年计算机应用技术交流会论文集[C];2008年
3 秦国;杜小勇;;基于用户层次信息的协同推荐算法[A];第二十一届中国数据库学术会议论文集(技术报告篇)[C];2004年
4 周玉妮;郑会颂;;基于浏览路径选择的蚁群推荐算法:用于移动商务个性化推荐系统[A];社会经济发展转型与系统工程——中国系统工程学会第17届学术年会论文集[C];2012年
5 苏日启;胡皓;汪秉宏;;基于网络的含时推荐算法[A];第五届全国复杂网络学术会议论文(摘要)汇集[C];2009年
6 梁莘q,
本文编号:2296585
本文链接:https://www.wllwen.com/kejilunwen/ruanjiangongchenglunwen/2296585.html