Sciweavers

1283 search results - page 1 / 257
» Learning Voting Trees
Sort
View
SIGKDD
2000
96views more  SIGKDD 2000»
13 years 4 months ago
The MP13 Approach to the KDD'99 Classifier Learning Contest
The MP13 method is best summarized as recognition based on voting decision trees using "pipes" in potential space. Keywords Voting; Decision Tree; Potential Space
Vladimir Miheev, Alexei Vopilov, Ivan Shabalin
AAAI
2007
13 years 7 months ago
Learning Voting Trees
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffre...
CVPR
2010
IEEE
14 years 1 months ago
A Hough Transform-Based Voting Framework for Action Recognition
We present a method to classify and localize human actions in video using a Hough transform voting framework. Random trees are trained to learn a mapping between densely-sampled f...
Angela Yao, Juergen Gall, Luc Van Gool
ICML
1999
IEEE
14 years 5 months ago
The Alternating Decision Tree Learning Algorithm
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
Yoav Freund, Llew Mason
AAAI
1996
13 years 6 months ago
Bagging, Boosting, and C4.5
Breiman's bagging and Freund and Schapire's boosting are recent methods for improving the predictive power of classi er learning systems. Both form a set of classi ers t...
J. Ross Quinlan