Sciweavers

352 search results - page 31 / 71
» A Fast Decision Tree Learning Algorithm
Sort
View
ML
2000
ACM
185views Machine Learning» more  ML 2000»
14 years 10 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
CVPR
2006
IEEE
16 years 1 months ago
Supervised Learning of Edges and Object Boundaries
Edge detection is one of the most studied problems in computer vision, yet it remains a very challenging task. It is difficult since often the decision for an edge cannot be made ...
Piotr Dollár, Zhuowen Tu, Serge Belongie
ECML
2006
Springer
15 years 2 months ago
Task-Driven Discretization of the Joint Space of Visual Percepts and Continuous Actions
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...
Sébastien Jodogne, Justus H. Piater
BMCBI
2010
135views more  BMCBI 2010»
14 years 11 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas
JMLR
2010
141views more  JMLR 2010»
14 years 5 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...