3718 search results - page 268 / 744 » On learning with dissimilarity functions |
189
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
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....
167
click to vote
CIKM
2000
Springer
15 years 11 months ago
2000
Springer
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...
178
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
202
click to vote
IJCAI
1989
15 years 7 months ago
1989
Several published reports show that instancebased learning algorithms yield high classification accuracies and have low storage requirements during supervised learning application...
149
click to vote
ICANN
2005
Springer
16 years 5 days ago
2005
Springer
We report results of an interdisciplinary project which aims at endowing a real robot system with the capacity for learning by goaldirected imitation. The control architecture is b...