Learning User Preferences for 2CP-Regression for a Recommender System

In this paper we deal with a task to learn a general user model from user ratings of a small set of objects. This general model is used to recommend top-k objects to the user. We consider several (also some new) alternatives of learning local preferences and several alternatives of aggregation (with or without 2CP-regression). The main contributions are evaluation of experiments on our prototype tool PrefWork with respect to several satisfaction measures and the proposal of method Peak for normalisation of numerical attributes. Our main objective is to keep the number of sample data which the user has to rate reasonable small.

[1]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS '01.

[2]  Robert T. Clemen,et al.  Making Hard Decisions: An Introduction to Decision Analysis , 1997 .

[3]  C. V. Ramamoorthy,et al.  Knowledge and Data Engineering , 1989, IEEE Trans. Knowl. Data Eng..

[4]  Hendrik Blockeel,et al.  Knowledge Discovery in Databases: PKDD 2003 , 2003, Lecture Notes in Computer Science.

[5]  Bruno Apolloni,et al.  Learning fuzzy decision trees , 1998, Neural Networks.

[6]  Ian Witten,et al.  Data Mining , 2000 .

[7]  Peter Vojtás,et al.  How to Learn Fuzzy User Preferences with Variable Objectives , 2009, IFSA/EUSFLAT Conf..

[8]  B. Baets,et al.  Twenty years of fuzzy preference structures (1978–1997) , 1997 .

[9]  Ian H. Witten,et al.  Data mining: practical machine learning tools and techniques, 3rd Edition , 1999 .

[10]  K. Cao-Van,et al.  Supervised ranking : from semantics to algorithms , 2003 .

[11]  Stuart E. Middleton,et al.  Capturing interest through inference and visualization: ontological user profiling in recommender systems , 2003, K-CAP '03.

[12]  Thorsten Joachims,et al.  Accurately interpreting clickthrough data as implicit feedback , 2005, SIGIR '05.

[13]  Yann Chevaleyre,et al.  Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets , 2010, Preference Learning.

[14]  Bruno Zanuttini,et al.  Learning Conditional Preference Networks with Queries , 2009, IJCAI.

[15]  Peter Vojtás,et al.  Considering Data-Mining Techniques in User Preference Learning , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[16]  Ronen I. Brafman,et al.  CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..

[17]  Werner Kießling,et al.  Preference Mining: A Novel Approach on Mining User Preferences for Personalized Applications , 2003, PKDD.

[18]  Alan Eckhardt,et al.  Inductive Models of User Preferences for Semantic Web , 2007, DATESO.

[19]  Jérôme Lang,et al.  The Complexity of Learning Separable ceteris paribus Preferences , 2009, IJCAI.

[20]  Taek-Soo Kim,et al.  A statistical model for user preference , 2005, IEEE Transactions on Knowledge and Data Engineering.

[21]  Thorsten Joachims,et al.  Optimizing search engines using clickthrough data , 2002, KDD.