72 search results - page 4 / 15 » Minimal Contraction of Preference Relations |
AI
2008
Springer
13 years 9 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
IDA
2005
Springer
14 years 3 months ago
2005
Springer
We consider the problem of learning a ranking function, that is a mapping from instances to rankings over a finite number of labels. Our learning method, referred to as ranking by...
NIPS
2007
13 years 11 months ago
2007
We propose an active learning algorithm that learns a continuous valuation model from discrete preferences. The algorithm automatically decides what items are best presented to an...
AAAI
2007
13 years 12 months ago
2007
We propose a novel kernel regression algorithm which takes into account order preferences on unlabeled data. Such preferences have the form that point x1 has a larger target value...
DLOG
2004
13 years 11 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...