Sciweavers

1209 search results - page 100 / 242
» Semi-Supervised Learning with Trees
Sort
View
AAAI
2008
13 years 10 months ago
Latent Tree Models and Approximate Inference in Bayesian Networks
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
Yi Wang, Nevin Lianwen Zhang, Tao Chen
ICML
2000
IEEE
14 years 8 months ago
FeatureBoost: A Meta-Learning Algorithm that Improves Model Robustness
Most machine learning algorithms are lazy: they extract from the training set the minimum information needed to predict its labels. Unfortunately, this often leads to models that ...
Joseph O'Sullivan, John Langford, Rich Caruana, Av...
ICML
1996
IEEE
14 years 8 months ago
Representing and Learning Quality-Improving Search Control Knowledge
Generating good, production-quality plans is an essential element in transforming planners from research tools into real-world applications, but one that has been frequently overl...
M. Alicia Pérez
ML
2012
ACM
413views Machine Learning» more  ML 2012»
12 years 3 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
SIGIR
2003
ACM
14 years 1 months ago
Question classification using support vector machines
Question classification is very important for question answering. This paper presents our research work on automatic question classification through machine learning approaches. W...
Dell Zhang, Wee Sun Lee