SQL-Rank++:一种具有隐式反馈的协同排序新方法

Zheng Yuan, Dugang Liu, Weike Pan, Zhong Ming
{"title":"SQL-Rank++:一种具有隐式反馈的协同排序新方法","authors":"Zheng Yuan, Dugang Liu, Weike Pan, Zhong Ming","doi":"10.1109/IJCNN55064.2022.9891935","DOIUrl":null,"url":null,"abstract":"Collaborative ranking with implicit feedback such as users' clicks is an important recommendation problem in various real-world applications. Most existing approaches are developed based on some pointwise or pairwise preference assumptions, although the listwise assumption is widely accepted as a better alternative due to its consistency with the final delivery result. In this paper, we first identify two fundamental limitations of the most current collaborative listwise approaches, in which their modeling is based on the Plackett-Luce probability. They are too strict and too weak relative preference comparison between the items with the same feedback and between the items with different feedback, respectively. As a response, we propose a novel and improved listwise approach called SQL-Rank++, which is able to learn the user preferences more accurately by leveraging some specifically constructed auxiliary lists, including some positive lists and some negative lists. Specifically, the positive lists have as much semantic consistency as the original list as possible, while the negative lists are the opposite. To construct these auxiliary lists, we design a self-based sampling strategy and a user similarity-based one. Finally, we have four variants of our SQL-Rank++ with different combinations of the auxiliary lists. We then conduct extensive experiments on four public datasets, and find that our SQL-Rank++ achieves very promising performance in comparison with several pointwise, pairwise and listwise approaches. We also study the influence of the two sampling strategies and the key components in our SQL-Rank++.","PeriodicalId":106974,"journal":{"name":"2022 International Joint Conference on Neural Networks (IJCNN)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"SQL-Rank++: A Novel Listwise Approach for Collaborative Ranking with Implicit Feedback\",\"authors\":\"Zheng Yuan, Dugang Liu, Weike Pan, Zhong Ming\",\"doi\":\"10.1109/IJCNN55064.2022.9891935\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Collaborative ranking with implicit feedback such as users' clicks is an important recommendation problem in various real-world applications. Most existing approaches are developed based on some pointwise or pairwise preference assumptions, although the listwise assumption is widely accepted as a better alternative due to its consistency with the final delivery result. In this paper, we first identify two fundamental limitations of the most current collaborative listwise approaches, in which their modeling is based on the Plackett-Luce probability. They are too strict and too weak relative preference comparison between the items with the same feedback and between the items with different feedback, respectively. As a response, we propose a novel and improved listwise approach called SQL-Rank++, which is able to learn the user preferences more accurately by leveraging some specifically constructed auxiliary lists, including some positive lists and some negative lists. Specifically, the positive lists have as much semantic consistency as the original list as possible, while the negative lists are the opposite. To construct these auxiliary lists, we design a self-based sampling strategy and a user similarity-based one. Finally, we have four variants of our SQL-Rank++ with different combinations of the auxiliary lists. We then conduct extensive experiments on four public datasets, and find that our SQL-Rank++ achieves very promising performance in comparison with several pointwise, pairwise and listwise approaches. We also study the influence of the two sampling strategies and the key components in our SQL-Rank++.\",\"PeriodicalId\":106974,\"journal\":{\"name\":\"2022 International Joint Conference on Neural Networks (IJCNN)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Joint Conference on Neural Networks (IJCNN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IJCNN55064.2022.9891935\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Joint Conference on Neural Networks (IJCNN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN55064.2022.9891935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

基于用户点击等隐式反馈的协同排名是各种实际应用中一个重要的推荐问题。大多数现有方法是基于一些点或成对偏好假设开发的,尽管列表假设由于与最终交付结果的一致性而被广泛接受为更好的替代方案。在本文中,我们首先确定了当前大多数协作列表方法的两个基本局限性,其中它们的建模是基于Plackett-Luce概率的。同一反馈项之间的相对偏好比较过于严格,不同反馈项之间的相对偏好比较过于薄弱。作为回应,我们提出了一种新的和改进的列表方法,称为SQL-Rank++,它能够通过利用一些专门构建的辅助列表更准确地学习用户偏好,包括一些正列表和一些负列表。具体来说,正表与原表具有尽可能多的语义一致性,而负表则相反。为了构建这些辅助列表,我们设计了一个基于自的采样策略和一个基于用户相似度的采样策略。最后,我们有四个sql - rank++的变体,它们具有辅助列表的不同组合。然后,我们在四个公共数据集上进行了广泛的实验,并发现我们的SQL-Rank++与一些点、成对和列表方法相比,取得了非常有希望的性能。我们还研究了两种采样策略的影响以及sql - rank++的关键组件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
SQL-Rank++: A Novel Listwise Approach for Collaborative Ranking with Implicit Feedback
Collaborative ranking with implicit feedback such as users' clicks is an important recommendation problem in various real-world applications. Most existing approaches are developed based on some pointwise or pairwise preference assumptions, although the listwise assumption is widely accepted as a better alternative due to its consistency with the final delivery result. In this paper, we first identify two fundamental limitations of the most current collaborative listwise approaches, in which their modeling is based on the Plackett-Luce probability. They are too strict and too weak relative preference comparison between the items with the same feedback and between the items with different feedback, respectively. As a response, we propose a novel and improved listwise approach called SQL-Rank++, which is able to learn the user preferences more accurately by leveraging some specifically constructed auxiliary lists, including some positive lists and some negative lists. Specifically, the positive lists have as much semantic consistency as the original list as possible, while the negative lists are the opposite. To construct these auxiliary lists, we design a self-based sampling strategy and a user similarity-based one. Finally, we have four variants of our SQL-Rank++ with different combinations of the auxiliary lists. We then conduct extensive experiments on four public datasets, and find that our SQL-Rank++ achieves very promising performance in comparison with several pointwise, pairwise and listwise approaches. We also study the influence of the two sampling strategies and the key components in our SQL-Rank++.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Parameterization of Vector Symbolic Approach for Sequence Encoding Based Visual Place Recognition Nested compression of convolutional neural networks with Tucker-2 decomposition SQL-Rank++: A Novel Listwise Approach for Collaborative Ranking with Implicit Feedback ACTSS: Input Detection Defense against Backdoor Attacks via Activation Subset Scanning ADV-ResNet: Residual Network with Controlled Adversarial Regularization for Effective Classification of Practical Time Series Under Training Data Scarcity Problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1