This note summarizes the main results presented in the author's Ph.D. thesis, supervised by Luc Boullart and Bernard De Baets. The thesis was defended on 14th October 2008 at Universiteit Gent. It is written in English and available for download at http://users.ugent.be/similar to wwaegemn/thesis.pdf. The work deals with preference learning, with emphasis on the ranking and ordinal regression machine learning settings and their connections to decision theory. Based on receiver operator characteristics analysis and graph theory, new performance measures are proposed to evaluate this type of models, and new algorithms are presented to compute and optimize these performance measures efficiently. Furthermore, the relationship with other setting...
We study the problem of ranking a set of items from nonactively chosen pairwise preferences where ea...
1 Introduction This paper discusses supervised learning of label rankings- the task of associating i...
We demonstrate that there are machine learning algorithms that can achieve success for two separate ...
This note summarizes the main results presented in the author's Ph.D. thesis, supervised by Luc Boul...
AbstractPreference learning is an emerging topic that appears in different guises in the recent lite...
In this paper, we introduce a framework for regularized least-squares (RLS) type of ranking cost fun...
Preference learning is a challenging problem that involves the prediction of complex structures, suc...
Multiple Criteria Decision Aiding (MCDA) offers a diversity of approaches designed for providing the...
Learning of preference relations has recently received significant attention in machine learning com...
The paper is concerned with learning to rank, which is to construct a model or a function for rankin...
AbstractWe study the problem of label ranking, a machine learning task that consists of inducing a m...
Learning preferences between objects constitutes a challenging task that notably differs from standa...
Relevance ranking consists in sorting a set of objects with respect to a given criterion. However, i...
We address the problem of rank elicitation as-suming that the underlying data generating pro-cess is...
Object ranking is one of the most relevant problems in the realm of preference learning and ranking....
We study the problem of ranking a set of items from nonactively chosen pairwise preferences where ea...
1 Introduction This paper discusses supervised learning of label rankings- the task of associating i...
We demonstrate that there are machine learning algorithms that can achieve success for two separate ...
This note summarizes the main results presented in the author's Ph.D. thesis, supervised by Luc Boul...
AbstractPreference learning is an emerging topic that appears in different guises in the recent lite...
In this paper, we introduce a framework for regularized least-squares (RLS) type of ranking cost fun...
Preference learning is a challenging problem that involves the prediction of complex structures, suc...
Multiple Criteria Decision Aiding (MCDA) offers a diversity of approaches designed for providing the...
Learning of preference relations has recently received significant attention in machine learning com...
The paper is concerned with learning to rank, which is to construct a model or a function for rankin...
AbstractWe study the problem of label ranking, a machine learning task that consists of inducing a m...
Learning preferences between objects constitutes a challenging task that notably differs from standa...
Relevance ranking consists in sorting a set of objects with respect to a given criterion. However, i...
We address the problem of rank elicitation as-suming that the underlying data generating pro-cess is...
Object ranking is one of the most relevant problems in the realm of preference learning and ranking....
We study the problem of ranking a set of items from nonactively chosen pairwise preferences where ea...
1 Introduction This paper discusses supervised learning of label rankings- the task of associating i...
We demonstrate that there are machine learning algorithms that can achieve success for two separate ...