Mixed graph of terms for query expansion
- 1 November 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 581-586
Abstract
It is well known that one way to improve the accuracy of a text retrieval system is to expand the original query with additional knowledge coded through topic-related terms. In the case of an interactive environment, the expansion, which is usually represented as a list of words, is extracted from documents whose relevance is known thanks to the feedback of the user. In this paper we argue that the accuracy of a text retrieval system can be improved if we employ a query expansion method based on a mixed Graph of Terms representation instead of a method based on a simple list of words. The graph, that is composed of a directed and an undirected subgraph, can be automatically extracted from a small set of only relevant documents (namely the user feedback) using a method for term extraction based on the probabilistic Topic Model. The evaluation of the proposed method has been carried out by performing a comparison with two less complex structures: one represented as a set of pairs of words and another that is a simple list of words.Keywords
This publication has 14 references indexed in Scilit:
- Improved latent concept expansion using hierarchical markov random fields2010
- Text classification from unlabeled documents with bootstrapping and feature projection techniquesInformation Processing & Management, 2009
- Selecting Effective Terms for Query Formulation2009
- Selecting good expansion terms for pseudo-relevance feedback2008
- A review of ontology based query expansionInformation Processing & Management, 2007
- Topics in semantic representation.Psychological Review, 2007
- Query expansion using random walk models2005
- Re-examining the potential effectiveness of interactive query expansion2003
- The INQUERY Retrieval System1992
- ON TERM SELECTION FOR QUERY EXPANSIONJournal of Documentation, 1990