259 search results - page 43 / 52 » Advances in decision tree construction |
110
click to vote
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
CSL
2006
Springer
14 years 9 months ago
2006
Springer
Enriching speech recognition output with sentence boundaries improves its human readability and enables further processing by downstream language processing modules. We have const...
JMLR
2008
14 years 9 months ago
2008
Ensemble learning algorithms such as boosting can achieve better performance by averaging over the predictions of some base hypotheses. Nevertheless, most existing algorithms are ...
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we introduce a robust novel approach for detecting objects category in cluttered scenes by generating boosted contextual descriptors of landmarks. In particular, ou...
CHI
2009
ACM
15 years 10 months ago
2009
ACM
Marketing research has longed for better ways to measure consumer behavior. In this paper, we explore using sociometric data to study social behaviors of group shoppers. We hypoth...