| Personalized query relaxations and repairs in knowledge-based recommendation |
| Full text |
Pdf
(1.32 MB)
|
Source
|
ACM Conference On Recommender Systems
archive
Proceedings of the third ACM conference on Recommender systems
table of contents
New York, New York, USA
SESSION: Doctoral symposium
table of contents
Pages 409-412
Year of Publication: 2009
ISBN:978-1-60558-435-5
|
|
Author
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): , Downloads (12 Months): , Citation Count: 0
|
|
|
ABSTRACT
Knowledge-based recommender systems are applications that support users in the process of retrieving items from a complex product assortment (e.g. computers, holiday packages, and financial services). Recommendations are determined on the basis of explicitly defined user requirements which can be interpreted as constraints to be fulfilled by the items stored in a product table. If no solution (item) can be found, existing knowledge-based recommenders propose non-personalized query relaxations and repair actions for the given set of customer requirements that support a recovery from the dead-end. This paper points out how the usability of knowledge-based recommender systems can be improved by introducing the concept of personalized query relaxations and repair actions.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
A. Felfernig and R. Burke. Constraint-based recommender systems: technologies and research issues. In ICEC'08: Proceedings of the 10th international conference on Electronic commerce, pages 1--10, Innsbruck, Austria, 2008. ACM.
|
| |
2
|
A. Felfernig, G. Friedrich, D. Jannach, and M. Stumptner. Consistency-based diagnosis of configuration knowledge bases. Artificial Intelligence, 152(2):213--234, 2004.
|
| |
3
|
A. Felfernig, G. Friedrich, M. Schubert, M. Mandl, M. Mairitsch, and E. Teppan. Plausible repairs for inconsistent requirements. In Proceedings of the 21st International Joint Conference on Artificial Intelligence, pages 791--796, Pasadena, California, USA, 2009.
|
| |
4
|
A. Ferguson and B. O'Sullivan. Relaxations and explanations for quantified constraint satisfaction problems. Principles and Practice of Constraint Programming -- CP 2006, pages 690--694, 2006.
|
| |
5
|
U. Junker. Quickxplain: Preferred explanations and relaxations for over-constrained problems. In Proceedings of the 19th National Conference on Artificial Intelligence, pages 167--172, Menlo Park, California, 2004. AAAI Press / The MIT Press.
|
| |
6
|
J. A. Konstan, B. N. Miller, D. Maltz, J. L. Herlocker, L. R. Gordon, and J. Riedl. Grouplens: applying collaborative filtering to usenet news. Communication ACM, 40(3):77--87, 1997.
|
| |
7
|
D. McSherry. Retrieval failure and recovery in recommender systems. Artificial Intelligence Review, 24(3-4):319--338, 2005.
|
| |
8
|
B. O'Sullivan, A. Papadopoulos, B. Faltings, and P. Pu. Representative explanations for over-constrained problems. In Proceedings of the National Conference on Artificial Intelligence, pages 323--328, Menlo Park, United States, 2007. American Association for Artificial Intelligence. Cork Constraint Computation Centre, University College Cork, Ireland.
|
| |
9
|
M. Pazzani and D. Billsus. Learning and revising user profiles: The identification of interesting web sites. Machine Learning, 27(3):313--331, 1997.
|
| |
10
|
R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(1):57--95, 1987.
|
| |
11
|
M. Schubert, A. Felfernig, and M. Mandl. Solving over-constrained problems using network analysis. In to appear at ICAIS'09, Klagenfurt, Austria, 2009.
|
|