Sciweavers

1683 search results - page 84 / 337
» Learning with Mixtures of Trees
Sort
View
CVPR
2008
IEEE
14 years 11 months ago
Learning stick-figure models using nonparametric Bayesian priors over trees
We present a fully probabilistic stick-figure model that uses a nonparametric Bayesian distribution over trees for its structure prior. Sticks are represented by nodes in a tree i...
Edward Meeds, David A. Ross, Richard S. Zemel, Sam...
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
14 years 28 days ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
ECAI
2008
Springer
13 years 11 months ago
MTForest: Ensemble Decision Trees based on Multi-Task Learning
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
Qing Wang, Liang Zhang, Mingmin Chi, Jiankui Guo
ECCV
2010
Springer
14 years 1 months ago
Discriminative Mixture-of-Templates for Viewpoint Classification
Abstract. Object viewpoint classification aims at predicting an approximate 3D pose of objects in a scene and is receiving increasing attention. State-of-the-art approaches to view...
CIDM
2007
IEEE
14 years 1 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...