Regret-based optimal recommendation sets in conversational recommender systems

50Citations
Citations of this article
65Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Current conversational recommender systems are unable to offer guarantees on the quality of their recommendations due to a lack of principled user utility models. We develop an approach to recommender systems that incorporates an explicit utility model into the recommendation process in a decision- theoretically sound fashion. The system maintains explicit constraints on user utility based on preferences revealed by the user's actions. We investigate a new decision criterion, setwise minimax regret (SMR), for constructing optimal recommendation sets: we develop algorithms for computing SMR, and prove that SMR determines choice sets for queries that are myopically optimal. This provides a natural basis for generating compound critiques in conversational recommender systems. Our simulation results suggest that this utility-theoretically sound approach to user modeling allows much more effective navigation of a product space than traditional approaches based on, for example, heuristic utility models and product similarity measures. Copyright 2009 ACM.

Cite

CITATION STYLE

APA

Viappiani, P., & Boutilier, C. (2009). Regret-based optimal recommendation sets in conversational recommender systems. In RecSys’09 - Proceedings of the 3rd ACM Conference on Recommender Systems (pp. 101–108). Association for Computing Machinery (ACM). https://doi.org/10.1145/1639714.1639732

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free