Sciweavers

4255 search results - page 366 / 851
» On Learning Boolean Functions
Sort
View
PR
2006
93views more  PR 2006»
15 years 6 months ago
Learning the kernel parameters in kernel minimum distance classifier
Choosing appropriate values for kernel parameters is one of the key problems in many kernel-based methods because the values of these parameters have significant impact on the per...
Daoqiang Zhang, Songcan Chen, Zhi-Hua Zhou
AIEDAM
2004
96views more  AIEDAM 2004»
15 years 6 months ago
Learning while designing
: This paper reports on preliminary results of an explorative study of a protocol analysis of team learning while designing using in-situ data. Two measurement-based frameworks are...
Gourabmoy Nath, John S. Gero
ICML
2009
IEEE
16 years 7 months ago
Predictive representations for policy gradient in POMDPs
We consider the problem of estimating the policy gradient in Partially Observable Markov Decision Processes (POMDPs) with a special class of policies that are based on Predictive ...
Abdeslam Boularias, Brahim Chaib-draa
CIKM
2009
Springer
16 years 1 months ago
A general magnitude-preserving boosting algorithm for search ranking
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
Chenguang Zhu, Weizhu Chen, Zeyuan Allen Zhu, Gang...
CIKM
2000
Springer
15 years 11 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...