Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Artificial Intelligence Review
An Expressive Query Language for Product Recommender Systems
Artificial Intelligence Review
Interactive Critiquing forCatalog Navigation in E-Commerce
Artificial Intelligence Review
The FindMe Approach to Assisted Browsing
IEEE Expert: Intelligent Systems and Their Applications
IEEE Transactions on Knowledge and Data Engineering
Hybrid critiquing-based recommender systems
Proceedings of the 12th international conference on Intelligent user interfaces
Evaluating critiquing-based recommender agents
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
The ins and outs of critiquing
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Knowledge-Based Systems
Knowledge-based navigation of complex information spaces
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Decision diagrams: fast and flexible support for case retrieval and recommendation
ECCBR'06 Proceedings of the 8th European conference on Advances in Case-Based Reasoning
Regret-based optimal recommendation sets in conversational recommender systems
Proceedings of the third ACM conference on Recommender systems
Donation dashboard: a recommender system for donation portfolios
Proceedings of the third ACM conference on Recommender systems
| Hi-index | 0.00 |
Critique-based conversational recommender systems are becoming common place, facilitating richer dialogues with the user than pure content-based or collaborative approaches. Most implementations of these systems combine similarity-based reasoning with constraints to enable users express preferences as critiques of products. Critiques are simple statements like "I like this product, but would prefer one that is less expensive". In this paper we exploit the fact that the repertoire of critiques available to the user is usually known ahead of interaction time to construct a critique graph representation of a catalogue. The critique graph provides a formal basis for reasoning about the set of products that can be reached using critiques from a given product. We introduce the concepts of product cover, support sets of products and catalogue cover. The latter is defined as a set of products from which all products in a catalogue can be reached using a specified best-case maximum number of critiques. We show that for the catalogues we considered, catalogue covers are typically small. We show that the sizes and distributions of product covers and support sets can be used to inform us of the structure of a catalogue and the challenges it would present for interactive navigation. We also propose the notion of a minimum catalogue cover as a set of "entry products" that ensure that all products in the catalogue can be reached by critiquing.