Sciweavers

92 search results - page 17 / 19
» Efficient Algorithms for Decision Tree Cross-validation
Sort
View
ICCV
2009
IEEE
14 years 10 months ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
ICS
2010
Tsinghua U.
14 years 3 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
AAAI
2010
13 years 7 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting
SOFSEM
2010
Springer
13 years 3 months ago
Approximate Structural Consistency
Abstract. We consider documents as words and trees on some alphabet and study how to compare them with some regular schemas on an alphabet . Given an input document I, we decide ...
Michel de Rougemont, Adrien Vieilleribière
FSKD
2007
Springer
98views Fuzzy Logic» more  FSKD 2007»
13 years 12 months ago
Learning Selective Averaged One-Dependence Estimators for Probability Estimation
Naïve Bayes is a well-known effective and efficient classification algorithm, but its probability estimation performance is poor. Averaged One-Dependence Estimators, simply AODE,...
Qing Wang, Chuan-hua Zhou, Jiankui Guo