2009 · 67 citations · 18 references
ComputingComputer ScienceInformation RetrievalMachine LearningNatural Language ProcessingDocument RepresentationEvaluation Of Retrieval SystemsFeature SelectionRanking ProblemsRetrieval ModelsVector Space RetrievalDocument SelectionEvaluation Of Ranking ModelsFeature-based Ranking ModelsLearning To RankLearning To Rank Loss FunctionsQuery-document MatchingQuery-document SimilaritySearch Result Ranking
Learning-to-rank has attracted great attention in the IR community. Much thought and research has been placed on query-document feature extraction and development of sophisticated learning-to-rank algorithms. However, relatively little research has been conducted on selecting documents for learning-to-rank data sets nor on the effect of these choices on the efficiency and effectiveness of learning-to-rank algorithms. In this paper, we employ a number of document selection methodologies, widely used in the context of evaluation – depth-k pooling, sampling (infAP, statAP), active-learning (MTC), and on-line heuristics (hedge). Certain methodologies, e.g. sampling and active-learning, have been shown to lead to efficient and effective evaluation. We investigate whether they can also enable efficient and effective learningto-rank. We compare them with the document selection methodology used to create the LETOR datasets. Further, all of the utilized methodologies are different in nature, and thus they construct training data sets with different properties, such as the proportion of relevant documents in the data or the similarity among them. We study how such properties affect the efficiency, effectiveness, and robustness of learning-to-rank collections.
18
Learning to rank using gradient descent
Chris Burges, Tal Shaked, Erin Renshaw et al. · 2005 · 2.8K citations
Training linear SVMs in linear time
Thorsten Joachims · 2006 · 2K citations
Modern Information Retrieval : A Brief Overview
Amit Singhal · IEEE Data(base) Engineering Bulletin · 2001 · 1.5K citations