Sciweavers

68 search results - page 3 / 14
» A General Boosting Method and its Application to Learning Ra...
Sort
View
SIGIR
2008
ACM
13 years 5 months ago
Learning to rank with partially-labeled data
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorith...
Kevin Duh, Katrin Kirchhoff
SIGIR
2008
ACM
13 years 5 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 6 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
MEDES
2009
ACM
13 years 10 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
2011
ACM
12 years 8 months ago
A boosting approach to improving pseudo-relevance feedback
Pseudo-relevance feedback has proven effective for improving the average retrieval performance. Unfortunately, many experiments have shown that although pseudo-relevance feedback...
Yuanhua Lv, ChengXiang Zhai, Wan Chen