Comparing and Combining Methods for Automatic Query Expansion

Query expansion is a well known method to improve the performance of information retrieval systems. In this work we have tested different approaches to extract the candidate query terms from the top ranked documents returned by the first-pass retrieval. One of them is the cooccurrence approach, based on measures of cooccurrence of the candidate and the query terms in the retrieved documents. The other one, the probabilistic approach, is based on the probability distribution of terms in the collection and in the top ranked set. We compare the retrieval improvement achieved by expanding the query with terms obtained with different methods belonging to both approaches. Besides, we have developed a na\"ive combination of both kinds of method, with which we have obtained results that improve those obtained with any of them separately. This result confirms that the information provided by each approach is of a different nature and, therefore, can be used in a combined manner.

[1]  Claudio Carpineto,et al.  An information-theoretic approach to automatic query expansion , 2001, TOIS.

[2]  Iadh Ounis,et al.  University of Glasgow at TREC 2004: Experiments in Web, Robust, and Terabyte Tracks with Terrier , 2004, TREC.

[3]  Ellen M. Voorhees,et al.  The TREC 2005 robust track , 2006, SIGF.

[4]  W. Bruce Croft,et al.  An Association Thesaurus for Information Retrieval , 1994, RIAO.

[5]  F. Clarke,et al.  Nonlinear oscillations and boundary value problems for Hamiltonian systems , 1982 .

[6]  Yuhua Long,et al.  Subharmonic Solutions with Prescribed Minimal Period of a Discrete Forced Pendulum Equation , 2004 .

[7]  Iadh Ounis,et al.  University of Glasgow at TREC 2006: Experiments in Terabyte and Enterprise Tracks with Terrier , 2006, TREC.

[8]  Ellen M. Voorhees,et al.  The TREC robust retrieval track , 2005, SIGF.

[9]  Van Rijsbergen,et al.  A theoretical basis for the use of co-occurence data in information retrieval , 1977 .

[10]  W. Bruce Croft,et al.  Improving the effectiveness of information retrieval with local context analysis , 2000, TOIS.

[11]  Claudio Carpineto,et al.  Comparing Weighting Models for Monolingual Information Retrieval , 2003, CLEF.

[12]  Hinrich Schütze,et al.  A Cooccurrence-Based Thesaurus and Two Applications to Information Retrieval , 1994, Inf. Process. Manag..

[13]  Paul H. Rabinowitz,et al.  On subharmonic solutions of hamiltonian systems , 1980 .

[14]  Carol Peters,et al.  European research letter: Cross-language system evaluation: The CLEF campaigns , 2001, J. Assoc. Inf. Sci. Technol..

[15]  Ellen M. Voorhees,et al.  Overview of the TREC 2004 Robust Retrieval Track , 2004 .

[16]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[17]  Ángel F. Zazo Rodríguez,et al.  REINA at CLEF 2006 Robust Task: Local Query Expansion Using Term Windows for Robust Retrieval , 2006, CLEF.

[18]  J. J. Rocchio,et al.  Relevance feedback in information retrieval , 1971 .

[19]  Gabriella Tarantello,et al.  Subharmonic solutions with prescribed minimal period for nonautonomous Hamiltonian systems , 1988 .

[20]  Peter Willett,et al.  The limitations of term co-occurrence data for query expansion in document retrieval systems , 1991, J. Am. Soc. Inf. Sci..

[21]  C. J. van Rijsbergen,et al.  Probabilistic models of information retrieval based on measuring the divergence from randomness , 2002, TOIS.