399 search results - page 73 / 80 » A Comparative Study of Methods for Transductive Transfer Lea... |
130
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
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...
128
Voted
ICMLA
2004
15 years 4 months ago
2004
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...
127
Voted
UAI
1996
15 years 4 months ago
1996
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...
153
Voted
DSP
2008
15 years 3 months ago
2008
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 ...
109
Voted
TSP
2008
15 years 3 months ago
2008
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...