This paper is devoted to the problem of learning to predict ordinal (i.e., ordered discrete) classes using classification and regression trees. We start with S-CART, a tree inducti...
Stefan Kramer, Gerhard Widmer, Bernhard Pfahringer...
We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an arbitrary, unknown input distribution. We gi...
Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, ...
We describe an algorithm for learning in the presence of multiple criteria. Our technique generalizes previous approaches in that it can learn optimal policies for all linear pref...
Most learning to rank research has assumed that the utility of different documents is independent, which results in learned ranking functions that return redundant results. The fe...
Aleksandrs Slivkins, Filip Radlinski, Sreenivas Go...
Aimsof traditional planners had beenlimited to finding a sequenceof operators rather than finding an optimal or neax-optimalfinal state. Consequent]y, the performanceimprovementsy...