1209 search results - page 91 / 242 » Semi-Supervised Learning with Trees |
NIPS
2001
14 years 11 months ago
2001
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
109
click to vote
UAI
2001
14 years 11 months ago
2001
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key ideas are that structure pri...
KI
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. We present a new classification algorithm that combines three properties: It generates decision trees, which proved a valuable and intelligible tool for classification an...
NECO
2002
14 years 9 months ago
2002
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...