We introduce a novel algorithm for decision tree learning in the multi-instance setting as originally defined by Dietterich et al. It differs from existing multi-instance tree lea...
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these...
Christopher J. C. Burges, Tal Shaked, Erin Renshaw...
We examine the relationship between the predictions made by different learning algorithms and true posterior probabilities. We show that maximum margin methods such as boosted tre...
To address the problem of algorithm selection for the classification task, we equip a relational case base with new similarity measures that are able to cope with multirelational ...
This paper examines motivations of knowledge workers to contribute expertise to online knowledge repositories that support informal learning, and presents findings from both a sur...