Sciweavers

2100 search results - page 59 / 420
» Learning to rank on graphs
Sort
View
SIGIR
2011
ACM
14 years 18 days ago
Learning to rank from a noisy crowd
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...
Abhimanu Kumar, Matthew Lease
MEDES
2009
ACM
15 years 2 months ago
Web page ranking based on fuzzy and learning automata
The main goal of web pages ranking is to find the interrelated pages. In this paper, we introduce an algorithm called FPR-DLA. In the proposed method learning automata is assigned...
Zohreh Anari, Mohammad Reza Meybodi, Babak Anari
SIGIR
2006
ACM
15 years 3 months ago
Learning a ranking from pairwise preferences
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...
Ben Carterette, Desislava Petkova
ADMA
2005
Springer
157views Data Mining» more  ADMA 2005»
15 years 3 months ago
Learning k-Nearest Neighbor Naive Bayes for Ranking
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...
Liangxiao Jiang, Harry Zhang, Jiang Su
DASFAA
2005
IEEE
141views Database» more  DASFAA 2005»
15 years 3 months ago
Learning Tree Augmented Naive Bayes for Ranking
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...
Liangxiao Jiang, Harry Zhang, Zhihua Cai, Jiang Su