Sciweavers

143 search results - page 13 / 29
» Lazy Learning for Improving Ranking of Decision Trees
Sort
View
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 7 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
ML
2000
ACM
185views Machine Learning» more  ML 2000»
13 years 7 months ago
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
Tjen-Sien Lim, Wei-Yin Loh, Yu-Shan Shih
DIS
2006
Springer
13 years 11 months ago
Optimal Bayesian 2D-Discretization for Variable Ranking in Regression
In supervised machine learning, variable ranking aims at sorting the input variables according to their relevance w.r.t. an output variable. In this paper, we propose a new relevan...
Marc Boullé, Carine Hue
SDM
2007
SIAM
130views Data Mining» more  SDM 2007»
13 years 9 months ago
Maximizing the Area under the ROC Curve with Decision Lists and Rule Sets
Decision lists (or ordered rule sets) have two attractive properties compared to unordered rule sets: they require a simpler classification procedure and they allow for a more co...
Henrik Boström
COLT
2008
Springer
13 years 9 months ago
The True Sample Complexity of Active Learning
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
Maria-Florina Balcan, Steve Hanneke, Jennifer Wort...