1055 search results - page 135 / 211 » Convex Factorization Machines |
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
85
Voted
ICML
2000
IEEE
16 years 1 months ago
2000
IEEE
This paper describes Pairwise Bisection: a nonparametric approach to optimizing a noisy function with few function evaluations. The algorithm uses nonparametric reasoning about si...
115
click to vote
ICML
1999
IEEE
16 years 1 months ago
1999
IEEE
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
127
click to vote
ALT
2002
Springer
15 years 9 months ago
2002
Springer
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...