Toward joint utilization of absolute and relative bandit feedback for conversational recommendation

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, CYBERNETICS User Modeling and User-Adapted Interaction Pub Date : 2024-01-27 DOI:10.1007/s11257-023-09388-5
{"title":"Toward joint utilization of absolute and relative bandit feedback for conversational recommendation","authors":"","doi":"10.1007/s11257-023-09388-5","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Conversational recommendation has been a promising solution for recent recommenders to address the cold-start problem suffered by traditional recommender systems. To actively elicit users’ dynamically changing preferences, conversational recommender systems periodically query the users’ preferences on item attributes and collect conversational feedback. However, most existing conversational recommender systems only enable users to provide one type of feedback, either absolute or relative. In practice, absolute feedback can be biased and imprecise due to users’ varying rating criteria. Relative feedback, in the meanwhile, suffers from its hardship to reveal the absolute user attitudes. Hence, asking only one type of questions throughout the whole conversation may not efficiently elicit users’ preferences of high accuracy. Moreover, many existing conversational recommender systems only allow users to provide binary feedback, which can be noisy when users do not have a particular inclination. To address the above issues, we propose a generalized conversational recommendation framework, hybrid rating-comparison conversational recommender system. The system can seamlessly ask absolute and relative questions and incorporate both types of feedback with possible neutral responses. While it is promising to utilize different types of feedback together, it can be difficult to build a joint model incorporating them as they bear different interpretations of users’ preferences. To ensure relative feedback can be effectively leveraged, we first propose a bandit algorithm, RelativeConUCB. On the basis of it, we further propose a new bandit algorithm, <span>ArcUCB</span>, to utilize jointly absolute and relative feedback with possible neutral responses for preference elicitation. The experiments on both synthetic and real-world datasets validate the advantage of our proposed methods, in comparison with existing bandit algorithms in conversational recommender systems</p>","PeriodicalId":49388,"journal":{"name":"User Modeling and User-Adapted Interaction","volume":"1 1","pages":""},"PeriodicalIF":3.0000,"publicationDate":"2024-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"User Modeling and User-Adapted Interaction","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11257-023-09388-5","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

Abstract

Conversational recommendation has been a promising solution for recent recommenders to address the cold-start problem suffered by traditional recommender systems. To actively elicit users’ dynamically changing preferences, conversational recommender systems periodically query the users’ preferences on item attributes and collect conversational feedback. However, most existing conversational recommender systems only enable users to provide one type of feedback, either absolute or relative. In practice, absolute feedback can be biased and imprecise due to users’ varying rating criteria. Relative feedback, in the meanwhile, suffers from its hardship to reveal the absolute user attitudes. Hence, asking only one type of questions throughout the whole conversation may not efficiently elicit users’ preferences of high accuracy. Moreover, many existing conversational recommender systems only allow users to provide binary feedback, which can be noisy when users do not have a particular inclination. To address the above issues, we propose a generalized conversational recommendation framework, hybrid rating-comparison conversational recommender system. The system can seamlessly ask absolute and relative questions and incorporate both types of feedback with possible neutral responses. While it is promising to utilize different types of feedback together, it can be difficult to build a joint model incorporating them as they bear different interpretations of users’ preferences. To ensure relative feedback can be effectively leveraged, we first propose a bandit algorithm, RelativeConUCB. On the basis of it, we further propose a new bandit algorithm, ArcUCB, to utilize jointly absolute and relative feedback with possible neutral responses for preference elicitation. The experiments on both synthetic and real-world datasets validate the advantage of our proposed methods, in comparison with existing bandit algorithms in conversational recommender systems

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在会话推荐中联合使用绝对和相对强盗反馈
摘要 会话推荐是近年来推荐系统解决传统推荐系统冷启动问题的一个很有前途的方案。为了主动获取用户动态变化的偏好,对话式推荐系统会定期查询用户对商品属性的偏好并收集对话反馈。然而,现有的对话式推荐系统大多只能让用户提供一种反馈,即绝对反馈或相对反馈。在实践中,由于用户的评分标准各不相同,绝对反馈可能会有偏差且不精确。而相对反馈则难以揭示用户的绝对态度。因此,在整个会话过程中只问一种类型的问题,可能无法高效、准确地获得用户的偏好。此外,许多现有的会话推荐系统只允许用户提供二进制反馈,当用户没有特定倾向时,这种反馈可能会产生噪音。针对上述问题,我们提出了一种通用会话推荐框架--混合评级比较会话推荐系统。该系统可以无缝地提出绝对问题和相对问题,并将这两种类型的反馈与可能的中立回答结合起来。虽然将不同类型的反馈结合起来使用很有前景,但要建立一个包含这些反馈的联合模型却很困难,因为它们对用户的偏好有着不同的解释。为确保有效利用相对反馈,我们首先提出了一种强盗算法--RelativeConUCB。在此基础上,我们进一步提出了一种新的强盗算法 ArcUCB,以联合利用绝对和相对反馈以及可能的中性回应来进行偏好激发。在合成数据集和真实数据集上的实验验证了我们提出的方法与对话推荐系统中现有的匪帮算法相比所具有的优势
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
User Modeling and User-Adapted Interaction
User Modeling and User-Adapted Interaction 工程技术-计算机:控制论
CiteScore
8.90
自引率
8.30%
发文量
35
审稿时长
>12 weeks
期刊介绍: User Modeling and User-Adapted Interaction provides an interdisciplinary forum for the dissemination of novel and significant original research results about interactive computer systems that can adapt themselves to their users, and on the design, use, and evaluation of user models for adaptation. The journal publishes high-quality original papers from, e.g., the following areas: acquisition and formal representation of user models; conceptual models and user stereotypes for personalization; student modeling and adaptive learning; models of groups of users; user model driven personalised information discovery and retrieval; recommender systems; adaptive user interfaces and agents; adaptation for accessibility and inclusion; generic user modeling systems and tools; interoperability of user models; personalization in areas such as; affective computing; ubiquitous and mobile computing; language based interactions; multi-modal interactions; virtual and augmented reality; social media and the Web; human-robot interaction; behaviour change interventions; personalized applications in specific domains; privacy, accountability, and security of information for personalization; responsible adaptation: fairness, accountability, explainability, transparency and control; methods for the design and evaluation of user models and adaptive systems
期刊最新文献
Hybrid music recommendation with graph neural networks AdaptUI: A Framework for the development of Adaptive User Interfaces in Smart Product-Service Systems Examining the merits of feature-specific similarity functions in the news domain using human judgments SNRBERT: session-based news recommender using BERT A deep neural network approach for fake news detection using linguistic and psychological features
×
引用
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