1683 search results - page 36 / 337 » Learning with Mixtures of Trees |
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Probabilistic latent semantic indexing (PLSI) represents documents of a collection as mixture proportions of latent topics, which are learned from the collection by an expectation...
ADMI
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We present a method for learning characteristic motion patterns of mobile agents. The method works on two levels. On the first level, it uses the expectation-maximization...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Speech recognition is usually based on Hidden Markov Models (HMMs), which represent the temporal dynamics of speech very efficiently, and Gaussian mixture models, which do non-opt...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
ECML
2005
Springer
14 years 1 months ago
2005
Springer
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...