Learning Maximal Marginal Relevance Model via Directly Optimizing Diversity Evaluation Measures
Authors:
Open Access
- 9 August 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 113-122
Abstract
In this paper we address the issue of learning a ranking model for search result diversification. In the task, a model concerns with both query-document relevance and document diversity is automatically created with training data. Ideally a diverse ranking model would be designed to meet the criterion of maximal marginal relevance, for selecting documents that have the least similarity to previously selected documents. Also, an ideal learning algorithm for diverse ranking would train a ranking model that could directly optimize the diversity evaluation measures with respect to the training data. Existing methods, however, either fail to model the marginal relevance, or train ranking models by minimizing loss functions that loosely related to the evaluation measures. To deal with the problem, we propose a novel learning algorithm under the framework of Perceptron, which adopts the ranking model that \emph{maximizes marginal relevance at ranking and can optimize any diversity evaluation measure in training}. The algorithm, referred to as PAMM (Perceptron Algorithm using Measures as Margins), first constructs positive and negative diverse rankings for each training query, and then repeatedly adjusts the model parameters so that the margins between the positive and negative rankings are maximized. Experimental results on three benchmark datasets show that PAMM significantly outperforms the state-of-the-art baseline methods.Keywords
Funding Information
- 973 Program of China (2014CB340401,2012CB316303)
- National Natural Science Foundation of China (61232010,61425016,61173064,61472401,61203298)
- 863 program of China (2014AA015204)
This publication has 28 references indexed in Scilit:
- Learning for search result diversification2014
- Combining implicit and explicit topic representations for result diversification2012
- Exploiting query reformulations for web search result diversification2010
- Learning to Disambiguate Search Queries from Short Sessions2009
- An Effectiveness Measure for Ambiguous and Underspecified Queries2009
- Improving personalized web search using result diversification2006
- A Markov random field model for term dependencies2005
- Cumulated gain-based evaluation of IR techniquesACM Transactions on Information Systems, 2002
- Probabilistic latent semantic indexing1999
- The use of MMR, diversity-based reranking for reordering documents and producing summaries1998