Sciweavers

72 search results - page 2 / 15
» Decision tree and instance-based learning for label ranking
Sort
View
101
Voted
ECML
2007
Springer
15 years 6 months ago
On Minimizing the Position Error in Label Ranking
Conventional classification learning allows a classifier to make a one shot decision in order to identify the correct label. However, in many practical applications, the problem ...
Eyke Hüllermeier, Johannes Fürnkranz
113
Voted
ICASSP
2010
IEEE
15 years 22 days ago
Weakly supervised learning with decision trees applied to fisheries acoustics
This paper addresses the training of classification trees for weakly labelled data. We call ”weakly labelled data”, a training set such as the prior labelling information pro...
Riwal Lefort, Ronan Fablet, Jean-Marc Boucher
106
Voted
AUSAI
2006
Springer
15 years 4 months ago
Lazy Learning for Improving Ranking of Decision Trees
Decision tree-based probability estimation has received great attention because accurate probability estimation can possibly improve classification accuracy and probability-based r...
Han Liang, Yuhong Yan
110
Voted
ICML
2003
IEEE
15 years 5 months ago
Decision Tree with Better Ranking
AUC(Area Under the Curve) of ROC(Receiver Operating Characteristics) has been recently used as a measure for ranking performanceof learning algorithms. In this paper, wepresent a ...
Charles X. Ling, Robert J. Yan
106
Voted
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 1 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford