Learning to rank for information retrieval

TY Liu - Foundations and Trends® in Information Retrieval, 2009 - nowpublishers.com
Learning to rank for Information Retrieval (IR) is a task to automatically construct a ranking
model using training data, such that the model can sort new objects according to their …

LETOR: A benchmark collection for research on learning to rank for information retrieval

T Qin, TY Liu, J Xu, H Li - Information Retrieval, 2010 - Springer
LETOR is a benchmark collection for the research on learning to rank for information
retrieval, released by Microsoft Research Asia. In this paper, we describe the details of the …

Adarank: a boosting algorithm for information retrieval

J Xu, H Li - Proceedings of the 30th annual international ACM …, 2007 - dl.acm.org
In this paper we address the issue of learning to rank for document retrieval. In the task, a
model is automatically created with some training data and then is utilized for ranking of …

[PDF][PDF] Letor: Benchmark dataset for research on learning to rank for information retrieval

TY Liu, J Xu, T Qin, W Xiong, H Li - … of SIGIR 2007 workshop on learning to …, 2007 - Citeseer
This paper is concerned with learning to rank for information retrieval (IR). Ranking is the
central problem for information retrieval, and employing machine learning techniques to …

Multi-document summarization using cluster-based link analysis

X Wan, J Yang - Proceedings of the 31st annual international ACM …, 2008 - dl.acm.org
The Markov Random Walk model has been recently exploited for multi-document
summarization by making use of the link relationships between sentences in the document …

Feature selection for ranking

X Geng, TY Liu, T Qin, H Li - … of the 30th annual international ACM SIGIR …, 2007 - dl.acm.org
Ranking is a very important topic in information retrieval. While algorithms for learning
ranking models have been intensively studied, this is not the case for feature selection …

Web graph similarity for anomaly detection

P Papadimitriou, A Dasdan, H Garcia-Molina - Journal of Internet Services …, 2010 - Springer
Web graphs are approximate snapshots of the web, created by search engines. They are
essential to monitor the evolution of the web and to compute global properties like …

Frank: a ranking method with fidelity loss

MF Tsai, TY Liu, T Qin, HH Chen, WY Ma - Proceedings of the 30th …, 2007 - dl.acm.org
Ranking problem is becoming important in many fields, especially in information retrieval
(IR). Many machine learning techniques have been proposed for ranking problem, such as …

Query-level loss functions for information retrieval

T Qin, XD Zhang, MF Tsai, DS Wang, TY Liu… - Information Processing & …, 2008 - Elsevier
Many machine learning technologies such as support vector machines, boosting, and neural
networks have been applied to the ranking problem in information retrieval. However, since …

[PDF][PDF] Learning to rank for information retrieval using genetic programming

JY Yeh, JY Lin, HR Ke, WP Yang - … of SIGIR 2007 workshop on learning to …, 2007 - Citeseer
One central problem of information retrieval (IR) is to determine which documents are
relevant and which are not to the user information need. This problem is practically handled …