广义推荐系统:一种高效的非线性协作过滤方法

IF 5.3 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Ling Huang;Can-Rong Guan;Zhen-Wei Huang;Yuefang Gao;Chang-Dong Wang;C. L. P. Chen
{"title":"广义推荐系统:一种高效的非线性协作过滤方法","authors":"Ling Huang;Can-Rong Guan;Zhen-Wei Huang;Yuefang Gao;Chang-Dong Wang;C. L. P. Chen","doi":"10.1109/TETCI.2024.3378599","DOIUrl":null,"url":null,"abstract":"Recently, Deep Neural Networks (DNNs) have been largely utilized in Collaborative Filtering (CF) to produce more accurate recommendation results due to their ability of extracting the nonlinear relationships in the user-item pairs. However, the DNNs-based models usually encounter high computational complexity, i.e., consuming very long training time and storing huge amount of trainable parameters. To address these problems, we develop a novel broad recommender system named Broad Collaborative Filtering (BroadCF), which is an efficient nonlinear collaborative filtering approach. Instead of DNNs, Broad Learning System (BLS) is used as a mapping function to learn the nonlinear matching relationships in the user-item pairs, which can avoid the above issues while achieving very satisfactory rating prediction performance. Contrary to DNNs, BLS is a shallow network that captures nonlinear relationships between input features simply and efficiently. However, directly feeding the original rating data into BLS is not suitable due to the very large dimensionality of the original rating vector. To this end, a new preprocessing procedure is designed to generate user-item rating collaborative vector, which is a low-dimensional user-item input vector that can leverage quality judgments of the most similar users/items. Convincing experimental results on seven datasets have demonstrated the effectiveness of the BroadCF algorithm.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":"8 4","pages":"2843-2857"},"PeriodicalIF":5.3000,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Broad Recommender System: An Efficient Nonlinear Collaborative Filtering Approach\",\"authors\":\"Ling Huang;Can-Rong Guan;Zhen-Wei Huang;Yuefang Gao;Chang-Dong Wang;C. L. P. Chen\",\"doi\":\"10.1109/TETCI.2024.3378599\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, Deep Neural Networks (DNNs) have been largely utilized in Collaborative Filtering (CF) to produce more accurate recommendation results due to their ability of extracting the nonlinear relationships in the user-item pairs. However, the DNNs-based models usually encounter high computational complexity, i.e., consuming very long training time and storing huge amount of trainable parameters. To address these problems, we develop a novel broad recommender system named Broad Collaborative Filtering (BroadCF), which is an efficient nonlinear collaborative filtering approach. Instead of DNNs, Broad Learning System (BLS) is used as a mapping function to learn the nonlinear matching relationships in the user-item pairs, which can avoid the above issues while achieving very satisfactory rating prediction performance. Contrary to DNNs, BLS is a shallow network that captures nonlinear relationships between input features simply and efficiently. However, directly feeding the original rating data into BLS is not suitable due to the very large dimensionality of the original rating vector. To this end, a new preprocessing procedure is designed to generate user-item rating collaborative vector, which is a low-dimensional user-item input vector that can leverage quality judgments of the most similar users/items. Convincing experimental results on seven datasets have demonstrated the effectiveness of the BroadCF algorithm.\",\"PeriodicalId\":13135,\"journal\":{\"name\":\"IEEE Transactions on Emerging Topics in Computational Intelligence\",\"volume\":\"8 4\",\"pages\":\"2843-2857\"},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2024-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Emerging Topics in Computational Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10486956/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computational Intelligence","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10486956/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

最近,深度神经网络(DNN)因其能够提取用户-物品对中的非线性关系,在很大程度上被用于协作过滤(CF),以产生更准确的推荐结果。然而,基于 DNNs 的模型通常具有很高的计算复杂性,即需要消耗很长的训练时间和存储大量的可训练参数。为了解决这些问题,我们开发了一种名为 "广义协同过滤"(BroadCF)的新型广义推荐系统,它是一种高效的非线性协同过滤方法。与 DNNs 不同,Broad Learning System(BLS)被用作映射函数来学习用户-物品配对中的非线性匹配关系,从而避免了上述问题,同时获得了非常令人满意的评级预测性能。与 DNN 不同,BLS 是一种浅层网络,能简单有效地捕捉输入特征之间的非线性关系。然而,由于原始评分向量的维度非常大,直接将原始评分数据输入 BLS 并不合适。为此,我们设计了一种新的预处理程序来生成用户-项目评分协作向量,这是一种低维的用户-项目输入向量,可以利用最相似用户/项目的质量判断。在七个数据集上令人信服的实验结果证明了 BroadCF 算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Broad Recommender System: An Efficient Nonlinear Collaborative Filtering Approach
Recently, Deep Neural Networks (DNNs) have been largely utilized in Collaborative Filtering (CF) to produce more accurate recommendation results due to their ability of extracting the nonlinear relationships in the user-item pairs. However, the DNNs-based models usually encounter high computational complexity, i.e., consuming very long training time and storing huge amount of trainable parameters. To address these problems, we develop a novel broad recommender system named Broad Collaborative Filtering (BroadCF), which is an efficient nonlinear collaborative filtering approach. Instead of DNNs, Broad Learning System (BLS) is used as a mapping function to learn the nonlinear matching relationships in the user-item pairs, which can avoid the above issues while achieving very satisfactory rating prediction performance. Contrary to DNNs, BLS is a shallow network that captures nonlinear relationships between input features simply and efficiently. However, directly feeding the original rating data into BLS is not suitable due to the very large dimensionality of the original rating vector. To this end, a new preprocessing procedure is designed to generate user-item rating collaborative vector, which is a low-dimensional user-item input vector that can leverage quality judgments of the most similar users/items. Convincing experimental results on seven datasets have demonstrated the effectiveness of the BroadCF algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
10.30
自引率
7.50%
发文量
147
期刊介绍: The IEEE Transactions on Emerging Topics in Computational Intelligence (TETCI) publishes original articles on emerging aspects of computational intelligence, including theory, applications, and surveys. TETCI is an electronics only publication. TETCI publishes six issues per year. Authors are encouraged to submit manuscripts in any emerging topic in computational intelligence, especially nature-inspired computing topics not covered by other IEEE Computational Intelligence Society journals. A few such illustrative examples are glial cell networks, computational neuroscience, Brain Computer Interface, ambient intelligence, non-fuzzy computing with words, artificial life, cultural learning, artificial endocrine networks, social reasoning, artificial hormone networks, computational intelligence for the IoT and Smart-X technologies.
×
引用
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学术官方微信