An interval-valued matrix factorization based trust-aware collaborative filtering algorithm for recommendation systems

IF 8.1 1区 计算机科学 N/A COMPUTER SCIENCE, INFORMATION SYSTEMS
{"title":"An interval-valued matrix factorization based trust-aware collaborative filtering algorithm for recommendation systems","authors":"","doi":"10.1016/j.ins.2024.121355","DOIUrl":null,"url":null,"abstract":"<div><p>In existing trust-aware collaborative filtering algorithms, each trust relationship between two users is usually represented by a real number, but such a number is neither sufficient to reflect the quantity of the trust relationship existing in the user’s mind nor easy to be given. This leads to the inaccuracy of the trust relationship and poor final recommendations. To solve this problem, we propose an approach to deduce interval-valued trust relationships from the given real-valued trust relationships, which enables the new trust relationships to optimally reflect the true trust relationships existing in users’ minds. The coming problem we face is how to fuse the interval-valued trust relationships and the real-valued ratings. Though most existing trust-aware collaborative filtering algorithms use matrix factorization to fuse the real-valued data, they are not capable of fusing interval-valued trust relationships and real-valued ratings. The reason is that the arithmetic operations on intervals and arithmetic operations on real numbers are different. Therefore, we proposed a novel interval-valued matrix factorization approach. After that, an interval-valued matrix factorization based trust-aware collaborative filtering (IMF_TCF) algorithm is designed. The experiments carried out with open datasets indicate that IMF_TCF achieves the best recommendation performance compared with the state-of-the-art algorithms.</p></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":null,"pages":null},"PeriodicalIF":8.1000,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025524012696","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"N/A","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In existing trust-aware collaborative filtering algorithms, each trust relationship between two users is usually represented by a real number, but such a number is neither sufficient to reflect the quantity of the trust relationship existing in the user’s mind nor easy to be given. This leads to the inaccuracy of the trust relationship and poor final recommendations. To solve this problem, we propose an approach to deduce interval-valued trust relationships from the given real-valued trust relationships, which enables the new trust relationships to optimally reflect the true trust relationships existing in users’ minds. The coming problem we face is how to fuse the interval-valued trust relationships and the real-valued ratings. Though most existing trust-aware collaborative filtering algorithms use matrix factorization to fuse the real-valued data, they are not capable of fusing interval-valued trust relationships and real-valued ratings. The reason is that the arithmetic operations on intervals and arithmetic operations on real numbers are different. Therefore, we proposed a novel interval-valued matrix factorization approach. After that, an interval-valued matrix factorization based trust-aware collaborative filtering (IMF_TCF) algorithm is designed. The experiments carried out with open datasets indicate that IMF_TCF achieves the best recommendation performance compared with the state-of-the-art algorithms.

基于区间值矩阵因式分解的推荐系统信任感知协同过滤算法
在现有的信任感知协同过滤算法中,两个用户之间的每一种信任关系通常用一个实数来表示,但这样的数字既不足以反映用户心中存在的信任关系的数量,也不容易给出。这就导致信任关系不准确,最终推荐效果不佳。为了解决这个问题,我们提出了一种从给定的实值信任关系中推导出区间值信任关系的方法,从而使新的信任关系能够最佳地反映用户心中存在的真实信任关系。我们即将面临的问题是如何融合区间值信任关系和实值评级。虽然现有的大多数信任感知协同过滤算法都使用矩阵因式分解来融合实值数据,但它们无法融合区间值信任关系和实值评级。原因在于区间的算术运算和实数的算术运算是不同的。因此,我们提出了一种新颖的区间值矩阵因式分解方法。随后,我们设计了一种基于区间值矩阵因式分解的信任感知协同过滤算法(IMF_TCF)。利用开放数据集进行的实验表明,与最先进的算法相比,IMF_TCF 实现了最佳的推荐性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信