3049 search results - page 11 / 610 » On the Convergence of Bound Optimization Algorithms |
TIT
2008
13 years 7 months ago
2008
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
IPL
2008
13 years 7 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
ICML
1998
IEEE
14 years 8 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
PKDD
2009
Springer
14 years 1 days ago
2009
Springer
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
AMC
2007
13 years 7 months ago
2007
A hierarchical least squares (HLS) algorithm is derived in details for identifying MIMO ARX-like systems based on the hierarchical identification principle. It is shown that the ...