4773 search results - page 563 / 955 » Learning from Uncertain Data |
171
click to vote
COLT
1999
Springer
15 years 11 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
200
click to vote
CVPR
2007
IEEE
15 years 10 months ago
2007
IEEE
Detection of objects of a given class is important for many applications. However it is difficult to learn a general detector with high detection rate as well as low false alarm r...
205
click to vote
ENC
2004
IEEE
15 years 10 months ago
2004
IEEE
A method to induce bayesian networks from data to overcome some limitations of other learning algorithms is proposed. One of the main features of this method is a metric to evalua...
188
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Probabilistic models have been previously shown to be efficient and effective for modeling and recognition of human motion. In particular we focus on methods which represent the h...
183
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...