Optimal recommendation sets: Covering uncertainty over user preferences

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2005, Pages 541-548

  Price, Bob ^a   Messinger, Paul R ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DECISION MAKING; OPTIMIZATION;

MAXIMIZATION OF EXPECTED MAX (MEM); REAL-WORLD DATA; SET-BASED OPTIMIZATION;

ARTIFICIAL INTELLIGENCE;

EID: 29344448519     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Basu, C.; Hirsh, H.; and Cohen, W. 1998. Recommendation as Classification: Using Social and Content-Based Information in Recommendation. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 714-720. Madison, WI: AAAI Press.
2. Ben-Akiva, M., and Lerman, S. R. 1985. Discrete Choice Analysis. Cambridge, Mass: MIT Press.
3. Boutilier, C.; Bacchus, F.; and Braftnan, R. 2001. UCP-Networks: A Directed Graphical Representation of Conditional Utilities. In Proceedings of the Seventeenth Annual Conference on Uncertainty in Artificial Intelligence, 56 - 64. Seattle, WA: Morgan Kaufmann.
4. Boutilier, C. 2002. A POMDP Formulation of Preference Elicitation Problem. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, 239-246. Edmonton, Alberta: AAAI Press.
5. Boutilier, C.; Brafman, R.; Domshlak, C.; Hoos, H. H.; and Poole, D. 2004. CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. Journal of Artificial Intelligence Research 21: 135-191.
6. Bradley, K., and Smyth, B. 2001. Improving Recommendation Diversity. In Procedings of the Twelfth Irish Conference on Artificial Intelligence and Cognitive Science, 85-94. Maynooth, Ireland.
7. Burke, R., Hammond, K., and Young, B. 1997. The FindMe Approach to Assisted Browsing. IEEE Expert 12(4): 32-40.
8. Croes, G. A. 1958. A Method for Solving Traveling-Salesman Problems. Operations Research 6(6): 791-812.
9. Elrod, T.; Louviere, J. J.; and Davey, K. S. 1992. An Empirical Comparison of Ratings-based and Choice-based Conjoint Models. Journal of Marketing Research 29(3): 368-377.
10. Faltings, B.; Torrens, M.; and Pu, P. 2004. Solution Generation with Qualitalive Models of Preferences. Computational Intelligence 20(2): 246-263.
11. Green, P. E., and Srinivasan, V. 1990. Conjoint Analysis in Marketing: New Developments with Implications for Research and Practice. Journal of Marketing 54(4): 3-19.
12. Johnson, R. M. 1974. Trade-off Analysis of Consumer Values. Journal of Marketing Research 11(2): 121-127.
13. Konstan, J. A.; Maltz, D.; Herlocker, J. L.; Gordon, L. R.; and Riedl, J. 1997. GroupLens: Applying Collaborative Filtering to Usenet News. Communications of the Association for Computing Machinery 40 (3): 77-87.
14. Louviere, J. J.; Hensher, D. A.; and Swait, J. D. 2000. Stated Choice Methods. Cambridge, England: Cambridge University Press.
15. Popescul, A.; Ungar, L.; Pennock, D.; and Lawrence, S. 2001. Probabilistic Models for Unified Collaborative and Content-Based Recommendation in Sparse-Data Environments. In Proceedings of the Seventeenth Annual Conference on Uncertainty in Artificial Intelligence, 437-444. Seattle, WA: Morgan Kaufmann.
16. Sengupta, J. K. 1972. Stochastic Programming: Methods and Applications. Amsterdam: North Holland Company.
17. Young, N. E. 2000. K-Medians, Facility Location, and the Chernoff-Wald Bound. In ACM-SIAM Symposium on Discrete Algorithms.