Sciweavers

7106 search results - page 906 / 1422
» Restricted Complexity, General Complexity
Sort
View
ICML
2004
IEEE
16 years 7 months ago
Leveraging the margin more carefully
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
Nir Krause, Yoram Singer
ICML
2004
IEEE
16 years 7 months ago
Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
Charles A. Sutton, Khashayar Rohanimanesh, Andrew ...
ICML
2003
IEEE
16 years 7 months ago
Hierarchical Policy Gradient Algorithms
Hierarchical reinforcement learning is a general framework which attempts to accelerate policy learning in large domains. On the other hand, policy gradient reinforcement learning...
Mohammad Ghavamzadeh, Sridhar Mahadevan
ICML
1999
IEEE
16 years 7 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
SIGSOFT
2009
ACM
16 years 7 months ago
Engineering search computing applications: vision and challenges
Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted ...
Marco Brambilla, Stefano Ceri