• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于加权相似度和核心用户-核心项目的推荐

Weighted Similarity and Core-User-Core-Item Based Recommendations.

作者信息

Zhang Zhuangzhuang, Dong Yunquan

机构信息

School of Electronic and Information Engineering, Nanjing University of Information Science and Technology, Nanjing 210044, China.

National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China.

出版信息

Entropy (Basel). 2022 Apr 27;24(5):609. doi: 10.3390/e24050609.

DOI:10.3390/e24050609
PMID:35626494
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9140734/
Abstract

In traditional recommendation algorithms, the users and/or the items with the same rating scores are equally treated. In real world, however, a user may prefer some items to other items and some users are more loyal to a certain item than other users. In this paper, therefore, we propose a measure by exploiting the difference in user-item relationships. In particular, we refer to the most important item of a user as his and the most important user of an item as its . We also propose a Core-User-Item Solver (CUIS) to calculate the core users and core items of the system, as well as the weighting coefficients for each user and each item. We prove that the CUIS algorithm converges to the optimal solution efficiently. Based on the weighted similarity measure and the obtained results by CUIS, we also propose three effective recommenders. Through experiments based on real-world data sets, we show that the proposed recommenders outperform corresponding traditional-similarity based recommenders, verify that the proposed weighted similarity can improve the accuracy of the similarity, and then improve the recommendation performance.

摘要

在传统推荐算法中,具有相同评分分数的用户和/或物品被同等对待。然而,在现实世界中,一个用户可能更喜欢某些物品而非其他物品,并且一些用户对某个物品比其他用户更忠诚。因此,在本文中,我们通过利用用户 - 物品关系中的差异提出一种度量方法。具体而言,我们将用户最重要的物品称为其“主物品”,将物品最重要的用户称为其“主用户”。我们还提出了一种核心用户 - 物品求解器(CUIS)来计算系统的核心用户和核心物品,以及每个用户和每个物品的加权系数。我们证明了CUIS算法能有效地收敛到最优解。基于加权相似性度量以及CUIS获得的结果,我们还提出了三种有效的推荐器。通过基于真实世界数据集的实验,我们表明所提出的推荐器优于相应的基于传统相似性的推荐器,验证了所提出的加权相似性可以提高相似性的准确性,进而提高推荐性能。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/7b6e4bc37919/entropy-24-00609-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/c8f2cc01ad78/entropy-24-00609-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/38c9d8aaa27f/entropy-24-00609-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/c27c6edd21fb/entropy-24-00609-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/32f0a4eec68e/entropy-24-00609-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/764a48edd62f/entropy-24-00609-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/dce379113dbf/entropy-24-00609-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/95488645793e/entropy-24-00609-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/574805fcc280/entropy-24-00609-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/7b6e4bc37919/entropy-24-00609-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/c8f2cc01ad78/entropy-24-00609-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/38c9d8aaa27f/entropy-24-00609-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/c27c6edd21fb/entropy-24-00609-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/32f0a4eec68e/entropy-24-00609-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/764a48edd62f/entropy-24-00609-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/dce379113dbf/entropy-24-00609-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/95488645793e/entropy-24-00609-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/574805fcc280/entropy-24-00609-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/d872/9140734/7b6e4bc37919/entropy-24-00609-g009.jpg

相似文献

1
Weighted Similarity and Core-User-Core-Item Based Recommendations.基于加权相似度和核心用户-核心项目的推荐
Entropy (Basel). 2022 Apr 27;24(5):609. doi: 10.3390/e24050609.
2
Modeling user rating preference behavior to improve the performance of the collaborative filtering based recommender systems.建立用户评分偏好模型,以提升基于协同过滤的推荐系统的性能。
PLoS One. 2019 Aug 1;14(8):e0220129. doi: 10.1371/journal.pone.0220129. eCollection 2019.
3
Session Recommendation via Recurrent Neural Networks over Fisher Embedding Vectors.基于Fisher嵌入向量的循环神经网络会话推荐
Sensors (Basel). 2019 Aug 10;19(16):3498. doi: 10.3390/s19163498.
4
A Recommendation Approach for Rating Prediction Based on User Interest and Trust Value.一种基于用户兴趣和信任值的评分预测推荐方法。
Comput Intell Neurosci. 2021 Mar 6;2021:6677920. doi: 10.1155/2021/6677920. eCollection 2021.
5
A framework for diversifying recommendation lists by user interest expansion.一种通过用户兴趣扩展使推荐列表多样化的框架。
Knowl Based Syst. 2016 Aug 1;105:83-95. doi: 10.1016/j.knosys.2016.05.010. Epub 2016 May 9.
6
Exploiting Dual-Attention Networks for Explainable Recommendation in Heterogeneous Information Networks.利用双注意力网络在异构信息网络中进行可解释推荐
Entropy (Basel). 2022 Nov 24;24(12):1718. doi: 10.3390/e24121718.
7
Kernelized Deep Learning for Matrix Factorization Recommendation System Using Explicit and Implicit Information.基于显式和隐式信息的核深度学习矩阵分解推荐系统
IEEE Trans Neural Netw Learn Syst. 2022 Jun 22;PP. doi: 10.1109/TNNLS.2022.3182942.
8
Attentional factorization machine with review-based user-item interaction for recommendation.基于评论的用户-物品交互注意力分解机用于推荐
Sci Rep. 2023 Aug 18;13(1):13454. doi: 10.1038/s41598-023-40633-4.
9
Users' Rating Predictions Using Collaborating Filtering Based on Users and Items Similarity Measures.基于用户和项目相似度度量的协同过滤用户评分预测。
Comput Intell Neurosci. 2022 Jul 8;2022:2347641. doi: 10.1155/2022/2347641. eCollection 2022.
10
AUI&GIV: Recommendation with Asymmetric User Influence and Global Importance Value.AUI&GIV:具有不对称用户影响力和全局重要性值的推荐方法
PLoS One. 2016 Feb 1;11(2):e0147944. doi: 10.1371/journal.pone.0147944. eCollection 2016.