The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Towards Conversational Recommender Systems
Abstract
People often ask others for restaurant recommendations as a way to discover new dining experiences. This makes restaurant recommendation an exciting scenario for recommender systems and has led to substantial research in this area. However, most such systems behave very differently from a human when asked for a recommendation. The goal of this paper is to begin to reduce this gap. In particular, humans can quickly establish preferences when asked to make a recommendation for someone they do not know. We address this cold-start recommendation problem in an online learning setting. We develop a preference elicitation framework to identify which questions to ask a new user to quickly learn their preferences. Taking advantage of latent structure in the recommendation space using a probabilistic latent factor model, our experiments with both synthetic and real world data compare different types of feedback and question selection strategies. We find that our framework can make very effective use of online user feedback, improving personalized recommendations over a static model by 25% after asking only 2 questions. Our results demonstrate dramatic benefits of starting from offline embeddings, and highlight the benefit of bandit-based explore-exploit strategies in this setting.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Prospect Theory: An Analysis of Decision under Risk
Kahneman, D., & Tversky, A. (1979) · Econometrica · doi:10.2307/1914185 · Cited by 48,524
Prospect theory: An analysis of decision under risk
Kahneman, D., & Tversky, A. (1988) · Decision, Probability and Utility · doi:10.1017/cbo9780511609220.014 · Cited by 32,474
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Item-based collaborative filtering recommendation algorithms
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372071 · Cited by 9,135 · cited 1×
“It predicts a user’s rating on an item either via the neighboring items’ ratings (neighbor-based [9, 28]) or by inferring latent factors in a low-dimensional embedding (latent factor-based [21, 29]).”
BackgroundProbabilistic Matrix Factorization
Mnih, A., & Salakhutdinov, R. (2007) · UCL Discovery (University College London) · Cited by 4,517
BPR: Bayesian Personalized Ranking from Implicit Feedback
Rendle, S., Freudenthaler, C., Gantner, Z., & Schmidt-Thieme, L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2618 · Cited by 4,242
(2011) · Springer eBooks · doi:10.1007/978-0-387-85820-3 · Cited by 3,761
Content-Based Recommendation Systems
Pazzani, M. J., & Billsus, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9_10 · Cited by 2,600
(2004) · Choice Reviews Online · doi:10.5860/choice.42-2286 · Cited by 2,565
A contextual-bandit approach to personalized news article recommendation
Li, L., Chu, W., Langford, J., & Schapire, R. E. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772758 · Cited by 2,562
Google news personalization: scalable online collaborative filtering
Das, A. S., Datar, M., Garg, A., & Rajaram, S. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242610 · Cited by 1,511
Expectation Propagation for approximate Bayesian inference
Minka, T. P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2294 · Cited by 1,392
Using confidence bounds for exploitation-exploration trade-offs
Auer, P. L. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944941 · Cited by 1,229
Bennett, J. R., & Lanning, S. (2007) · Cited by 1,216
Seale, C., Gobo, G., Gubrium, J., & Silverman, D. (2004) · SAGE Publications Ltd eBooks · doi:10.4135/9781848608191 · Cited by 1,030
(2011) · Cited by 1,000
Gambling in a rigged casino: The adversarial multi-armed bandit problem
Auer, P., Cesa-Bianchi, N., Freund, Y., & Schapire, R. E. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492488 · Cited by 742
Elements of a plan-based theory of speech acts
COHEN, P., & PERRAULT, C. (1979) · Cognitive Science · doi:10.1016/s0364-0213(79)80006-3 · Cited by 724
Cox, I. J., Miller, M. L., Minka, T. P., Papathomas, T. V., & Yianilos, P. N. (2000) · IEEE Transactions on Image Processing · doi:10.1109/83.817596 · Cited by 712
Regression-based latent factor models
Agarwal, D., & Chen, B.-C. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557029 · Cited by 514
A Short Introduction to Learning to Rank
LI, H. (2011) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.e94.d.1854 · Cited by 348
Shi, Y., Karatzoglou, A., Baltrunas, L., Larson, M., Oliver, N., & Hanjalić, A. (2012) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2365952.2365981 · Cited by 323
Less is more: probabilistic models for retrieving fewer relevant documents
Chen, H., & Karger, D. R. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148245 · Cited by 319
Critiquing-based recommenders: survey and emerging trends
Chen, L., & Pu, P. (2012) · User Modeling and User-Adapted Interaction · doi:10.1007/s11257-011-9108-6 · Cited by 281
Improving recommender systems with adaptive conversational strategies
Mahmood, T., & Ricci, F. (2009) · Proceedings of the 20th ACM conference on Hypertext and hypermedia · doi:10.1145/1557914.1557930 · Cited by 259
Matchbox: large scale online bayesian recommendations
Stern, D. H., Herbrich, R., & Graepel, T. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526725 · Cited by 221
Active Learning in Recommender Systems
Rubens, N., Kaplan, D., & Sugiyama, M. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_23 · Cited by 176
Interactive collaborative filtering
Zhao, X., Zhang, W., & Wang, J. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505690 · Cited by 165 · cited 6×
“In contrast, recent work has moved towards continuously learning recommenders [4, 16, 33].”
BackgroundMethodResultInfluentialEfficient Thompson sampling for online matrix-factorization recommendation
Kawale, J., Bui, H., Kveton, B., Thanh, L. T., & Chawla, S. (2015) · ePrints Soton (University of Southampton) · doi:10.5555/2969239.2969384 · Cited by 115
Choice-based preference elicitation for collaborative filtering recommender systems
Loepp, B., Hussein, T., & Ziegler, J. (2014) · CHI Conference on Human Factors in Computing Systems · doi:10.1145/2556288.2557069 · Cited by 110
Reducing Dueling Bandits to Cardinal BanditsPreprint
Ailon, N., Joachims, T., & Karnin, Z. S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.3396 · Cited by 103
Ensemble contextual bandits for personalized recommendation
Tang, L., Jiang, Y., Li, L., & Li, T. (2014) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2645710.2645732 · Cited by 100
Learning multiple-question decision trees for cold-start recommendation
Sun, M., Li, F., Lee, J., Zhou, K., Lebanon, G., & Hongyuan Zha, B. (2013) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2433396.2433451 · Cited by 81
Personalized Recommendation via Parameter-Free Contextual Bandits
Tang, L., Jiang, Y., Li, L., Zeng, C., & Li, T. (2015) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2766462.2767707 · Cited by 79
DJ-MC: A Reinforcement-Learning Agent for Music Playlist RecommendationPreprint
Liebman, E., Saar‐Tsechansky, M., & Stone, P. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.1880 · Cited by 77
Explore-exploit in top-N recommender systems via Gaussian processes
Vanchinathan, H. P., Nikolic, I., Bona, F. D., & Krause, A. (2014) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2645710.2645733 · Cited by 76
On the Evolution of Critiquing Recommenders
McGinty, L., & Reilly, J. (2010) · Springer eBooks · doi:10.1007/978-0-387-85820-3_13 · Cited by 71
A Dynamic Approach to Reducing Dialog in On-Line Decision Guides
Doyle, M., & Cunningham, P. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44527-7_6 · Cited by 70
Collaborative Ranking with a Push at the Top
Christakopoulou, K., & Banerjee, A. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2736277.2741678 · Cited by 57
Self-citationEliciting the users' unknown preferences
Neidhardt, J., Schuster, R., Seyfang, L., & Werthner, H. (2014) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2645710.2645767 · Cited by 56
Effects of Position Bias on Click-Based Recommender Evaluation
Hofmann, K., Schuth, A., Bellogín, A., & de Rijke, M. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06028-6_67 · Cited by 53
Self-citationImproving the User Experience during Cold Start through Choice-Based Preference Elicitation
Graus, M. P., & Willemsen, M. C. (2015) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/2792838.2799681 · Cited by 42
Individualized rank aggregation using nuclear norm regularization
Lu, Y., & Negahban, S. N. (2015) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2015.7447183 · Cited by 42
Usability Guidelines for Product Recommenders Based on Example Critiquing Research
Pu, P., Faltings, B. V., Chen, L., Zhang, J., & Viappiani, P. (2010) · Springer eBooks · doi:10.1007/978-0-387-85820-3_16 · Cited by 38
Generalized Thompson sampling for sequential decision-making and causal inference
Ortega, P. A., & Braun, D. A. (2014) · Max Planck Digital Library · Cited by 37
Relative confidence sampling for efficient on-line ranker evaluation
Zoghi, M., Whiteson, S., de Rijke, M., & Munos, R. (2014) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2556195.2556256 · Cited by 32
Generalized Thompson sampling for sequential decision-making and causal inference
Ortega, P. A., & Braun, D. A. (2014) · Complex Adaptive Systems Modeling · doi:10.1186/2194-3206-2-2 · Cited by 23
Optimizing adaptive marketing experiments with the multi-armed bandit
Schwartz, E. M. (2013) · Scholarly Commons (University of Pennsylvania) · Cited by 4
Cited by
Geng, S., Liu, S., Fu, Z., Ge, Y., & Zhang, Y. (2022) · Proceedings of the 16th ACM Conference on Recommender Systems · doi:10.1145/3523227.3546767 · Cited by 556
A Theoretical Framework for Conversational Search
Radlinski, F., & Craswell, N. (2017) · Proceedings of the 2017 Conference on Conference Human Information Interaction and Retrieval · doi:10.1145/3020165.3020183 · Cited by 439
Self-citationConversational Recommender System
Sun, Y., & Zhang, Y. (2018) · The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval · doi:10.1145/3209978.3210002 · Cited by 378
Advances and challenges in conversational recommender systems: A survey
Gao, C., Lei, W., He, X., de Rijke, M., & Chua, T.-S. (2021) · AI Open · doi:10.1016/j.aiopen.2021.06.002 · Cited by 337
Towards Conversational Search and Recommendation: System Ask, User Respond
Zhang, Y., Chen, X., Ai, Q., Yang, L., & Croft, W. B. (2018) · Proceedings of the 27th ACM International Conference on Information and Knowledge Management · doi:10.1145/3269206.3271776 · Cited by 319
Metadata
- Authors
- Christakopoulou, K., Radlinski, F., & Hofmann, K.
- Venue
- Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
- Publisher
- ACM
- Published
- 2016-08-13
- Pages
- 815-824
- OpenAlex
- W2349436533
- Cited by
- 412
- References
- 48
- FWCI
- 20.23
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.