105 search results - page 3 / 21 » Learning with Tree-Averaged Densities and Distributions |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
In this paper, we investigate a simple, mistakedriven learning algorithm for discriminative training of continuous density hidden Markov models (CD-HMMs). Most CD-HMMs for automat...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
In 1990, E. Baum gave an elegant polynomial-time algorithm for learning the intersection of two origin-centered halfspaces with respect to any symmetric distribution (i.e., any D s...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
ECSQARU
2009
Springer
14 years 2 months ago
2009
Springer
We describe a procedure for inducing conditional densities within the mixtures of truncated exponentials (MTE) framework. We analyse possible conditional MTE specifications and pr...