Sciweavers

399 search results - page 73 / 80
» A Comparative Study of Methods for Transductive Transfer Lea...
Sort
View
CP
2006
Springer
13 years 11 months ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
ICMLA
2004
13 years 9 months ago
Two new regularized AdaBoost algorithms
AdaBoost rarely suffers from overfitting problems in low noise data cases. However, recent studies with highly noisy patterns clearly showed that overfitting can occur. A natural s...
Yijun Sun, Jian Li, William W. Hager
UAI
1996
13 years 9 months ago
Efficient Approximations for the Marginal Likelihood of Incomplete Data Given a Bayesian Network
We discuss Bayesian methods for learning Bayesian networks when data sets are incomplete. In particular, we examine asymptotic approximations for the marginal likelihood of incomp...
David Maxwell Chickering, David Heckerman
DSP
2008
13 years 7 months ago
Extension of higher-order HMC modeling with application to image segmentation
In this work, we propose to improve the neighboring relationship ability of the Hidden Markov Chain (HMC) model, by extending the memory lengthes of both the Markov chain process ...
Lamia Benyoussef, Cyril Carincotte, Stéphan...
TSP
2008
89views more  TSP 2008»
13 years 7 months ago
The Kernel Least-Mean-Square Algorithm
The combination of the famed kernel trick and the least-mean-square (LMS) algorithm provides an interesting sample by sample update for an adaptive filter in reproducing Kernel Hil...
Weifeng Liu, Puskal P. Pokharel, Jose C. Principe