716 search results - page 39 / 144 » Optimizing Sorting with Machine Learning Algorithms |
119
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
Classifiers that refrain from classification in certain cases can significantly reduce the misclassification cost. However, the parameters for such abstaining classifiers are ofte...
COLT
2008
Springer
15 years 3 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
143
click to vote
COLT
2010
Springer
14 years 12 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
111
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
121
Voted
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we evaluate the performance of ten well-known evolutionary and non-evolutionary rule learning algorithms. The comparative study is performed on a real-world classiï...