Direct maximization of average precision by hill-climbing, with a comparison to a maximum entropy approach

Authors:
William Morgan;Warren Greiff;John Henderson
Affiliations:
The MITRE Corporation, Bedford, MA;The MITRE Corporation, Bedford, MA;The MITRE Corporation, Bedford, MA
Venue:
HLT-NAACL-Short '04 Proceedings of HLT-NAACL 2004: Short Papers
Year:
2004

Citing 2
Cited 4

Numerical recipes in C (2nd ed.): the art of scientific computing

Numerical recipes in C (2nd ed.): the art of scientific computing
Some simple effective approximations to the 2-Poisson model for probabilistic weighted retrieval

SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval

Image retrieval using Markov Random Fields and global image features

Proceedings of the ACM International Conference on Image and Video Retrieval
Improved latent concept expansion using hierarchical markov random fields

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
A supervised learning approach to entity search

AIRS'06 Proceedings of the Third Asia conference on Information Retrieval Technology
Modeling term dependencies with quantum language models for IR

Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an algorithm for choosing term weights to maximize average precision. The algorithm performs successive exhaustive searches through single directions in weight space. It makes use of a novel technique for considering all possible values of average precision that arise in searching for a maximum in a given direction. We apply the algorithm and compare this algorithm to a maximum entropy approach.