Fast computation of query relaxations for knowledge-based recommenders

“No matching product found” is an undesirable message for the user of an online product finder application or interactive recommender system. Query Relaxation is an approach to recovery from such retrieval failures and works by eliminating individual parts of the original query in order to find products that satisfy as many of the user's constraints as possible. In this paper, new techniques for the fast computation of “user-optimal” query relaxations are proposed. We show how the number of costly catalog queries can be minimized with the help of a query pre-processing approach, how we can compute relaxations that contain at least n items in the recommendation, and finally, how a recent conflict-detection algorithm can be applied for fast determination of preferred conflicts in interactive recovery scenarios.

[1]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[2]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[3]  Kristian J. Hammond,et al.  The FindMe Approach to Assisted Browsing , 1997, IEEE Expert.

[4]  Parke Godfrey,et al.  Minimization in Cooperative Response to Failing Database Queries , 1994, Int. J. Cooperative Inf. Syst..

[5]  Robin D. Burke,et al.  The Wasabi Personal Shopper: A Case-Based Recommender System , 1999, AAAI/IAAI.

[6]  Francesco Ricci,et al.  ITR: A Case-Based Travel Advisory System , 2002, ECCBR.

[7]  David McSherry,et al.  Incremental Relaxation of Unsuccessful Queries , 2004, ECCBR.

[8]  Francesco Ricci,et al.  Supporting User Query Relaxation in a Recommender System , 2004, EC-Web.

[9]  M. Zanker,et al.  Geizhals.at: vom Preisvergleich zur E-Commerce Serviceplattform , 2004 .

[10]  Dietmar Jannach,et al.  ADVISOR SUITE - A Knowledge-Based Sales Advisory-System , 2004, ECAI.

[11]  Barry Smyth,et al.  Dynamic Critiquing , 2004, ECCBR.

[12]  Pat Langley,et al.  A Personalized System for Conversational Recommendations , 2011, J. Artif. Intell. Res..

[13]  Ulrich Junker,et al.  QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems , 2004, AAAI.

[14]  David McSherry,et al.  Retrieval Failure and Recovery in Recommender Systems , 2005, Artificial Intelligence Review.

[15]  Gerhard Friedrich,et al.  An Integrated Environment for the Development of Knowledge-Based Recommender Applications , 2006, Int. J. Electron. Commer..

[16]  Dietmar Jannach.  Techniques for Fast Query Relaxation in Content-Based Recommender Systems , 2006, KI.

[17]  Dietmar Jannach,et al.  Conflict-Directed Relaxation of Constraints in Content-Based Recommender Systems , 2006, IEA/AIE.

[18]  Dietmar Jannach.  Finding Preferred Query Relaxations in Content-based Recommenders , 2007 .

[19]  Li Chen,et al.  Hybrid critiquing-based recommender systems , 2007, IUI '07.

[20]  Francesco Ricci,et al.  Supporting product selection with query editing recommendations , 2007, RecSys '07.

[21]  Boi Faltings,et al.  Conversational recommenders with adaptive suggestions , 2007, RecSys '07.