3395 search results - page 47 / 679 » Learning to efficiently rank |
SIGIR
2011
ACM
12 years 10 months ago
2011
ACM
We study how to best use crowdsourced relevance judgments learning to rank [1, 7]. We integrate two lines of prior work: unreliable crowd-based binary annotation for binary classi...
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
We introduce a novel approach to combining rankings from multiple retrieval systems. We use a logistic regression model or an SVM to learn a ranking from pairwise document prefere...
ADMA
2005
Springer
14 years 1 months ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
DASFAA
2005
IEEE
14 years 1 months ago
2005
IEEE
Naive Bayes has been widely used in data mining as a simple and effective classification algorithm. Since its conditional independence assumption is rarely true, numerous algorit...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...