Sciweavers

812 search results - page 31 / 163
» Preference-based learning to rank
Sort
View
SIGIR
2006
ACM
14 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»
14 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»
14 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
CIKM
2010
Springer
13 years 8 months ago
Learning to rank relevant and novel documents through user feedback
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...
Abhimanyu Lad, Yiming Yang
CVPR
2008
IEEE
13 years 11 months ago
Improving local learning for object categorization by exploring the effects of ranking
Local learning for classification is useful in dealing with various vision problems. One key factor for such approaches to be effective is to find good neighbors for the learning ...
Tien-Lung Chang, Tyng-Luh Liu, Jen-Hui Chuang