Sciweavers

2164 search results - page 79 / 433
» Learning to rank for information retrieval
Sort
View
CIKM
2010
Springer
15 years 4 months ago
Ranking under temporal constraints
This paper introduces the notion of temporally constrained ranked retrieval, which, given a query and a time constraint, produces the best possible ranked list within the specifi...
Lidan Wang, Donald Metzler, Jimmy Lin
CIKM
2009
Springer
16 years 23 days ago
Relying on topic subsets for system ranking estimation
Ranking a number of retrieval systems according to their retrieval effectiveness without relying on costly relevance judgments was first explored by Soboroff et al [6]. Over th...
Claudia Hauff, Djoerd Hiemstra, Franciska de Jong,...
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
16 years 1 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
ISNN
2009
Springer
16 years 22 days ago
A New Instance-Based Label Ranking Approach Using the Mallows Model
In this paper, we introduce a new instance-based approach to the label ranking problem. This approach is based on a probability model on rankings which is known as the Mallows mode...
Weiwei Cheng, Eyke Hüllermeier
AIRWEB
2007
Springer
16 years 11 days ago
Transductive Link Spam Detection
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
Dengyong Zhou, Chris Burges, Tao Tao