1209 search results - page 91 / 242 » Semi-Supervised Learning with Trees |
123
Voted
NIPS
2001
15 years 4 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...
147
Voted
UAI
2001
15 years 4 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...
99
Voted
KI
2002
Springer
15 years 2 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...
114
Voted
NECO
2002
15 years 2 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...
91
Voted
ICML
2006
IEEE
16 years 3 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...