Techniques for Fast Query Relaxation in Content-Based Recommender Systems
‘Query relaxation’ is one of the basic approaches to deal with unfulfillable or conflicting customer requirements in content-based recommender systems: When no product in the catalog exactly matches the customer requirements, the idea is to retrieve those products that fulfill as many of the requirements as possible by removing (relaxing) parts of the original query to the catalog. In general, searching for such an ‘maximum succeeding subquery’ is a non-trivial task because a) the theoretical search space exponentially grows with the number of the subqueries and b) the allowed response times are strictly limited in interactive recommender applications.
In this paper, we describe new techniques for the fast computation of ‘user-optimal’ query relaxations: First, we show how the number of required database queries for determining an optimal relaxation can be limited to the number of given subqueries by evaluating the subqueries individually. Next, it is described how the problem of finding relaxations returning ‘at-least-n’ products can be efficiently solved by analyzing these partial query results in memory. Finally, we show how a general-purpose conflict detection algorithm can be applied for determining ‘preferred’ conflicts in interactive relaxation scenarios.
The described algorithms have been implemented and evaluated in a knowledge-based recommender framework; the paper comprises a discussion of implementation details, experiences, and experimental results.
KeywordsRecommender System Customer Requirement Case Base Reasoning Database Query Conjunctive Query
Unable to display preview. Download preview PDF.
- 1.Amer-Yahia, S., Lakshmanan, L.V.S., Pandit, S.: FleXPath: flexible structure and full-text querying for XML. In: Proceedings ACM SIGMOD International Conference on Management of Data, Paris, pp. 83–94 (2004)Google Scholar
- 2.Bridge, D.: Product recommendation systems: A new direction. In: Weber, R., Wangenheim, C. (eds.) Workshop Programme at 4th Intl. Conference on Case-Based Reasoning, pp. 79–86 (2001)Google Scholar
- 4.Jannach, D.: ADVISOR SUITE - A knowledge-based sales advisory system. In: Proceedings of ECAI/PAIS 2004, Valencia, pp. 720–724 (2004)Google Scholar
- 6.Junker, U.: QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems. In: Proceedings AAAI’2004, San Jose, pp. 167–172 (2004)Google Scholar
- 7.Lee, D.: Query Relaxation for XML Model. Ph.D Dissertation, University of California, Los Angeles (June 2002)Google Scholar
- 8.McSherry, D.: Explanation of Retrieval Mismatches in Recommender System Dialogues. In: ICCBR Workshop on Mixed-Initiative Case-Based Reasoning, Trondheim, pp. 191–199 (2003)Google Scholar
- 9.McSherry, D.: Incremental Relaxation of Unsuccessful Queries. In: Funk, P., González Calero, P.A. (eds.) ECCBR 2004. LNCS (LNAI), vol. 3155, pp. 331–345. Springer, Heidelberg (2004)Google Scholar
- 10.McSherry, D.: Maximally Successful Relaxations of Unsuccessful Queries. In: Proceedings of the 15th Conference on Artificial Intelligence and Cognitive Science, Castlebar, Ireland, pp. 127–136 (2004)Google Scholar
- 12.Ricci, F., Mirzadeh, N., Bansal, M.: Supporting User Query Relaxation in a Recommender System. In: Bauknecht, K., Bichler, M., Pröll, B. (eds.) EC-Web 2004. LNCS, vol. 3182, pp. 31–40. Springer, Heidelberg (2004)Google Scholar
- 13.Smyth, B., et al.: Compound Critiques for Conversational Recommender Systems. In: IEEE/WIC/ACM International Conference on Web Intelligence(WI’04), Maebashi, China, pp. 145–151 (2004)Google Scholar