Clustering of conversational bandits with posterior sampling for user preference learning and elicitation
Conversational recommender systems elicit user preference via conversational interactions. By introducing conversational key-terms, existing conversational recommenders can effectively reduce the need for extensive exploration required by a traditional interactive recommender. However, there are sti...
Gespeichert in:
Veröffentlicht in: | User modeling and user-adapted interaction 2023-11, Vol.33 (5), p.1065-1112 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1112 |
---|---|
container_issue | 5 |
container_start_page | 1065 |
container_title | User modeling and user-adapted interaction |
container_volume | 33 |
creator | Li, Qizhi Zhao, Canzhe Yu, Tong Wu, Junda Li, Shuai |
description | Conversational recommender systems elicit user preference via conversational interactions. By introducing conversational key-terms, existing conversational recommenders can effectively reduce the need for extensive exploration required by a traditional interactive recommender. However, there are still limitations of existing conversational recommender approaches eliciting user preference via key-terms. First, the key-term data of the items needs to be carefully labeled, which requires a lot of human efforts. Second, the number of the human labeled key-terms is limited and the granularity of the key-terms is fixed, while the elicited user preference is usually from coarse-grained to fine-grained during the conversations. In this paper, we propose a clustering of conversational bandits algorithm. To avoid the human labeling efforts and automatically learn the key-terms with the proper granularity, we online cluster the items and generate meaningful key-terms for the items during the conversational interactions. Our algorithm is general and can also be used in the user clustering when the feedback from multiple users is available, which further leads to more accurate learning and generations of conversational key-terms. Moreover, to learn the user clustering structure more efficiently in more complex user clustering structure, we further propose a simple yet effective soft user clustering module to perform exploration on user clustering via sampling the posterior user representations. We analyze the regret bound of our learning algorithm. In the empirical evaluations, without using any human labeled key-terms, our algorithm effectively generates meaningful coarse-to-fine grained key-terms and performs as well as or better than the state-of-the-art baseline. |
doi_str_mv | 10.1007/s11257-023-09358-x |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2875210986</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2875210986</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-50dcb2769b4f9b6172f0f129ff9ae98f2a53ad46e2e5fb870cb1ec08b82e879d3</originalsourceid><addsrcrecordid>eNp9kE1LxDAURYMoOI7-AVcB19F8TJtkKYNfMOBG1yFNXzRDp6lJq-O_t50K7lyFR-65vHcQumT0mlEqbzJjvJCEckGoFoUi-yO0YIUUhAnNjtGCar4iTJXqFJ3lvKUjVEq9QGHdDLmHFNo3HD12sf2ElG0fYmsbXNm2Dn3GX6F_x108BGPC2e66ZiL8OAwZEu4SeEjQOsAN2NROnyOLoQku9Ie6c3TibZPh4vddotf7u5f1I9k8PzytbzfECaZ7UtDaVVyWulp5XZVMck8949p7bUErz20hbL0qgUPhKyWpqxg4qirFQUldiyW6mnu7FD8GyL3ZxiGN12TDlSw4o1qVY4rPKZdizuP2pkthZ9O3YdRMSs2s1IxKzUGp2Y-QmKHcTcIg_VX_Q_0AT1N9HA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2875210986</pqid></control><display><type>article</type><title>Clustering of conversational bandits with posterior sampling for user preference learning and elicitation</title><source>Business Source Complete</source><source>Springer Nature - Complete Springer Journals</source><creator>Li, Qizhi ; Zhao, Canzhe ; Yu, Tong ; Wu, Junda ; Li, Shuai</creator><creatorcontrib>Li, Qizhi ; Zhao, Canzhe ; Yu, Tong ; Wu, Junda ; Li, Shuai</creatorcontrib><description>Conversational recommender systems elicit user preference via conversational interactions. By introducing conversational key-terms, existing conversational recommenders can effectively reduce the need for extensive exploration required by a traditional interactive recommender. However, there are still limitations of existing conversational recommender approaches eliciting user preference via key-terms. First, the key-term data of the items needs to be carefully labeled, which requires a lot of human efforts. Second, the number of the human labeled key-terms is limited and the granularity of the key-terms is fixed, while the elicited user preference is usually from coarse-grained to fine-grained during the conversations. In this paper, we propose a clustering of conversational bandits algorithm. To avoid the human labeling efforts and automatically learn the key-terms with the proper granularity, we online cluster the items and generate meaningful key-terms for the items during the conversational interactions. Our algorithm is general and can also be used in the user clustering when the feedback from multiple users is available, which further leads to more accurate learning and generations of conversational key-terms. Moreover, to learn the user clustering structure more efficiently in more complex user clustering structure, we further propose a simple yet effective soft user clustering module to perform exploration on user clustering via sampling the posterior user representations. We analyze the regret bound of our learning algorithm. In the empirical evaluations, without using any human labeled key-terms, our algorithm effectively generates meaningful coarse-to-fine grained key-terms and performs as well as or better than the state-of-the-art baseline.</description><identifier>ISSN: 0924-1868</identifier><identifier>EISSN: 1573-1391</identifier><identifier>DOI: 10.1007/s11257-023-09358-x</identifier><language>eng</language><publisher>Dordrecht: Springer Netherlands</publisher><subject>Algorithms ; Clustering ; Computer Science ; Empirical analysis ; Machine learning ; Management of Computing and Information Systems ; Multimedia Information Systems ; Recommender systems ; Sampling ; User Interfaces and Human Computer Interaction</subject><ispartof>User modeling and user-adapted interaction, 2023-11, Vol.33 (5), p.1065-1112</ispartof><rights>The Author(s), under exclusive licence to Springer Nature B.V. 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-50dcb2769b4f9b6172f0f129ff9ae98f2a53ad46e2e5fb870cb1ec08b82e879d3</citedby><cites>FETCH-LOGICAL-c319t-50dcb2769b4f9b6172f0f129ff9ae98f2a53ad46e2e5fb870cb1ec08b82e879d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11257-023-09358-x$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11257-023-09358-x$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27903,27904,41467,42536,51298</link.rule.ids></links><search><creatorcontrib>Li, Qizhi</creatorcontrib><creatorcontrib>Zhao, Canzhe</creatorcontrib><creatorcontrib>Yu, Tong</creatorcontrib><creatorcontrib>Wu, Junda</creatorcontrib><creatorcontrib>Li, Shuai</creatorcontrib><title>Clustering of conversational bandits with posterior sampling for user preference learning and elicitation</title><title>User modeling and user-adapted interaction</title><addtitle>User Model User-Adap Inter</addtitle><description>Conversational recommender systems elicit user preference via conversational interactions. By introducing conversational key-terms, existing conversational recommenders can effectively reduce the need for extensive exploration required by a traditional interactive recommender. However, there are still limitations of existing conversational recommender approaches eliciting user preference via key-terms. First, the key-term data of the items needs to be carefully labeled, which requires a lot of human efforts. Second, the number of the human labeled key-terms is limited and the granularity of the key-terms is fixed, while the elicited user preference is usually from coarse-grained to fine-grained during the conversations. In this paper, we propose a clustering of conversational bandits algorithm. To avoid the human labeling efforts and automatically learn the key-terms with the proper granularity, we online cluster the items and generate meaningful key-terms for the items during the conversational interactions. Our algorithm is general and can also be used in the user clustering when the feedback from multiple users is available, which further leads to more accurate learning and generations of conversational key-terms. Moreover, to learn the user clustering structure more efficiently in more complex user clustering structure, we further propose a simple yet effective soft user clustering module to perform exploration on user clustering via sampling the posterior user representations. We analyze the regret bound of our learning algorithm. In the empirical evaluations, without using any human labeled key-terms, our algorithm effectively generates meaningful coarse-to-fine grained key-terms and performs as well as or better than the state-of-the-art baseline.</description><subject>Algorithms</subject><subject>Clustering</subject><subject>Computer Science</subject><subject>Empirical analysis</subject><subject>Machine learning</subject><subject>Management of Computing and Information Systems</subject><subject>Multimedia Information Systems</subject><subject>Recommender systems</subject><subject>Sampling</subject><subject>User Interfaces and Human Computer Interaction</subject><issn>0924-1868</issn><issn>1573-1391</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kE1LxDAURYMoOI7-AVcB19F8TJtkKYNfMOBG1yFNXzRDp6lJq-O_t50K7lyFR-65vHcQumT0mlEqbzJjvJCEckGoFoUi-yO0YIUUhAnNjtGCar4iTJXqFJ3lvKUjVEq9QGHdDLmHFNo3HD12sf2ElG0fYmsbXNm2Dn3GX6F_x108BGPC2e66ZiL8OAwZEu4SeEjQOsAN2NROnyOLoQku9Ie6c3TibZPh4vddotf7u5f1I9k8PzytbzfECaZ7UtDaVVyWulp5XZVMck8949p7bUErz20hbL0qgUPhKyWpqxg4qirFQUldiyW6mnu7FD8GyL3ZxiGN12TDlSw4o1qVY4rPKZdizuP2pkthZ9O3YdRMSs2s1IxKzUGp2Y-QmKHcTcIg_VX_Q_0AT1N9HA</recordid><startdate>20231101</startdate><enddate>20231101</enddate><creator>Li, Qizhi</creator><creator>Zhao, Canzhe</creator><creator>Yu, Tong</creator><creator>Wu, Junda</creator><creator>Li, Shuai</creator><general>Springer Netherlands</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88G</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2M</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PSYQQ</scope><scope>Q9U</scope></search><sort><creationdate>20231101</creationdate><title>Clustering of conversational bandits with posterior sampling for user preference learning and elicitation</title><author>Li, Qizhi ; Zhao, Canzhe ; Yu, Tong ; Wu, Junda ; Li, Shuai</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-50dcb2769b4f9b6172f0f129ff9ae98f2a53ad46e2e5fb870cb1ec08b82e879d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Clustering</topic><topic>Computer Science</topic><topic>Empirical analysis</topic><topic>Machine learning</topic><topic>Management of Computing and Information Systems</topic><topic>Multimedia Information Systems</topic><topic>Recommender systems</topic><topic>Sampling</topic><topic>User Interfaces and Human Computer Interaction</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Qizhi</creatorcontrib><creatorcontrib>Zhao, Canzhe</creatorcontrib><creatorcontrib>Yu, Tong</creatorcontrib><creatorcontrib>Wu, Junda</creatorcontrib><creatorcontrib>Li, Shuai</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Psychology Database (Alumni)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>ProQuest Psychology</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest One Psychology</collection><collection>ProQuest Central Basic</collection><jtitle>User modeling and user-adapted interaction</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Qizhi</au><au>Zhao, Canzhe</au><au>Yu, Tong</au><au>Wu, Junda</au><au>Li, Shuai</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Clustering of conversational bandits with posterior sampling for user preference learning and elicitation</atitle><jtitle>User modeling and user-adapted interaction</jtitle><stitle>User Model User-Adap Inter</stitle><date>2023-11-01</date><risdate>2023</risdate><volume>33</volume><issue>5</issue><spage>1065</spage><epage>1112</epage><pages>1065-1112</pages><issn>0924-1868</issn><eissn>1573-1391</eissn><abstract>Conversational recommender systems elicit user preference via conversational interactions. By introducing conversational key-terms, existing conversational recommenders can effectively reduce the need for extensive exploration required by a traditional interactive recommender. However, there are still limitations of existing conversational recommender approaches eliciting user preference via key-terms. First, the key-term data of the items needs to be carefully labeled, which requires a lot of human efforts. Second, the number of the human labeled key-terms is limited and the granularity of the key-terms is fixed, while the elicited user preference is usually from coarse-grained to fine-grained during the conversations. In this paper, we propose a clustering of conversational bandits algorithm. To avoid the human labeling efforts and automatically learn the key-terms with the proper granularity, we online cluster the items and generate meaningful key-terms for the items during the conversational interactions. Our algorithm is general and can also be used in the user clustering when the feedback from multiple users is available, which further leads to more accurate learning and generations of conversational key-terms. Moreover, to learn the user clustering structure more efficiently in more complex user clustering structure, we further propose a simple yet effective soft user clustering module to perform exploration on user clustering via sampling the posterior user representations. We analyze the regret bound of our learning algorithm. In the empirical evaluations, without using any human labeled key-terms, our algorithm effectively generates meaningful coarse-to-fine grained key-terms and performs as well as or better than the state-of-the-art baseline.</abstract><cop>Dordrecht</cop><pub>Springer Netherlands</pub><doi>10.1007/s11257-023-09358-x</doi><tpages>48</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0924-1868 |
ispartof | User modeling and user-adapted interaction, 2023-11, Vol.33 (5), p.1065-1112 |
issn | 0924-1868 1573-1391 |
language | eng |
recordid | cdi_proquest_journals_2875210986 |
source | Business Source Complete; Springer Nature - Complete Springer Journals |
subjects | Algorithms Clustering Computer Science Empirical analysis Machine learning Management of Computing and Information Systems Multimedia Information Systems Recommender systems Sampling User Interfaces and Human Computer Interaction |
title | Clustering of conversational bandits with posterior sampling for user preference learning and elicitation |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T17%3A36%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Clustering%20of%20conversational%20bandits%20with%20posterior%20sampling%20for%20user%20preference%20learning%20and%20elicitation&rft.jtitle=User%20modeling%20and%20user-adapted%20interaction&rft.au=Li,%20Qizhi&rft.date=2023-11-01&rft.volume=33&rft.issue=5&rft.spage=1065&rft.epage=1112&rft.pages=1065-1112&rft.issn=0924-1868&rft.eissn=1573-1391&rft_id=info:doi/10.1007/s11257-023-09358-x&rft_dat=%3Cproquest_cross%3E2875210986%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2875210986&rft_id=info:pmid/&rfr_iscdi=true |