检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吴哲夫[1] 程界斌 方路平[1] WU Zhefu;CHENG Jiebin;FANG Luping(College of Information Engineering,Zhejiang University of Technology,Hangzhou 310023)
出 处:《高技术通讯》2023年第10期1020-1028,共9页Chinese High Technology Letters
基 金:浙江省自然科学基金重点项目(LZ22F010005)资助。
摘 要:针对协同过滤推荐算法中用户所交互的物品对其决策的不同贡献度问题,提出了一种基于相关注意力的协同过滤推荐算法。该算法结合深度学习中的注意力机制为不同物品分配不同的权值来捕获与目标物品最相关的物品,探索不同物品的权重对模型预测的影响并以此提升推荐的准确度;在此基础上,为了解决推荐算法鲁棒性低的问题,进一步提出了注意力协同对抗性训练的推荐算法,通过对抗性学习的方法并使用快速梯度符号算法(FGSM)构建对抗样本输入模型进行对抗训练,缓解模型受扰动的影响从而提升算法鲁棒性。在Pinterest和MovieLens-1M这2个数据集上的实验结果表明,所提算法不仅有效提升了推荐算法的准确度,同时也增强了推荐系统的鲁棒性。Aiming at the different contribution of items interacted by users to their decision-making in collaborative filtering recommendation algorithm,a collaborative filtering recommendation algorithm based on relevant attention is proposed.The algorithm combines the attention mechanism in deep learning to assign different weights to different items to capture the items most relevant to the target item,explore the influence of the weight of different items on the model prediction,and thereby improve the accuracy of the recommendation;further,in order to solve the problem of low robustness of the proposed model,a recommendation algorithm for attention collaborative adversarial training is proposed.Through the adversarial learning method and using the fast gradient sign method(FGSM)algorithm to build an adversarial sample input model for adversarial training,the model is alleviated from the impact of disturbance and the robustness of the model is improved.Experimental results on the two datasets of Pinterest and MovieLens-1M show that the proposed algorithm not only effectively improves the accuracy of the recommendation algorithm,but also enhances the robustness of the recommendation system.
分 类 号:TP391.3[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171