Sciweavers

701 search results - page 67 / 141
» Self Bounding Learning Algorithms
Sort
View

Publication
173views
12 years 6 months ago
Max-Flow Segmentation of the Left Ventricle by Recovering Subject-Specific Distributions via a Bound of the Bhattacharyya Measur
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
Ismail Ben Ayed, Hua-mei Chen, Kumaradevan Punitha...
ATAL
2006
Springer
13 years 11 months ago
A hierarchical approach to efficient reinforcement learning in deterministic domains
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
Carlos Diuk, Alexander L. Strehl, Michael L. Littm...
COLT
1999
Springer
14 years 7 hour ago
An Adaptive Version of the Boost by Majority Algorithm
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
Yoav Freund
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 7 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
CEC
2009
IEEE
14 years 2 months ago
Multi-objective optimization using self-adaptive differential evolution algorithm
- In this paper, we propose a Multiobjective Self-adaptive Differential Evolution algorithm with objective-wise learning strategies (OW-MOSaDE) to solve numerical optimization pr...
Vicky Ling Huang, Shuguang Z. Zhao, Rammohan Malli...