6715 search results - page 669 / 1343 » Learning from a Test Set |
190
click to vote
ECML
2007
Springer
16 years 1 months ago
2007
Springer
Given a binary classification task, a ranker sorts a set of instances from highest to lowest expectation that the instance is positive. We propose a lexicographic ranker, LexRank,...
217
click to vote
CLEF
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We promote the use of explicit medical knowledge to solve retrieval of information both visual and textual. For text, this knowledge is a set of concepts from a Meta-thes...
200
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...
223
click to vote
LWA
2008
15 years 9 months ago
2008
Where Information Retrieval (IR) and Text Categorization delivers a set of (ranked) documents according to a query, users of large document collections would rather like to receiv...
192
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
: Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimizatio...