Evaluating Natural User Preferences for Selective Retrieval

Learning user preferences is a complex area, especially difficult for performing experiments - every person is different and has different preferences, which often change in time. In this paper, we propose a method for testing a preference learning method that is in a sense more general than our previous attempts of testing an inductive method. We address the issue of limited rating set that results on larger datasets into more objects with the highest rating.

[1]  Eyke Hüllermeier,et al.  Pairwise Preference Learning and Ranking , 2003, ECML.

[2]  Yiyu Yao,et al.  Measuring Retrieval Effectiveness Based on User Preference of Documents , 1995, J. Am. Soc. Inf. Sci..

[3]  Peter Vojtás,et al.  PHASES: A User Profile Learning Approach for Web Search , 2007, IEEE/WIC/ACM International Conference on Web Intelligence (WI'07).

[4]  Rob Potharst,et al.  Monotone Decision Trees , 1997 .

[5]  H. Zimmermann,et al.  Latent connectives in human decision making , 1980 .

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

[7]  Yiyu Yao,et al.  Query formulation in linear retrieval models , 1990, J. Am. Soc. Inf. Sci..

[8]  Ronald R. Yager,et al.  Generalized OWA Aggregation Operators , 2004, Fuzzy Optim. Decis. Mak..

[9]  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.

[10]  Eyke Hüllermeier,et al.  On Minimizing the Position Error in Label Ranking , 2007, ECML.