Most models of utility elicitation in decision support and interactive optimization assume a predefined set of "catalog" features over which user preferences are express...
Almost all tree kernels proposed in the literature match substructures without taking into account their relative positioning with respect to one another. In this paper, we propos...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
We address the problem of learning classifiers using several kernel functions. On the contrary to many contributions in the field of learning from different sources of information...
Matthieu Kowalski, Marie Szafranski, Liva Ralaivol...