OpenAIR @ RGU >
Design and Technology >
Computing >
Conference publications (Computing) >

Please use this identifier to cite or link to this item:
This item has been viewed 2 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
Song CIKM 2002.pdf182.4 kBAdobe PDFView/Open
Title: Inferring query models by computing information flow.
Authors: Bruza, Peter D.
Song, Dawei
Keywords: Inference
Information flow
Query language modelling
Issue Date: Nov-2002
Publisher: ACM Press
Citation: BRUZA, P. D. and SONG, D., 2002. Inferring query models by computing information flow. In: Proceedings of the 11th International ACM Conference on Information and Knowledge Management (CIKM 2002). 4-9 November 2002. New York: ACM Press. pp. 260-269.
Abstract: The language modelling approach to information retrieval can also be used to compute query models. A query model can be envisaged as an expansion of an initial query. The more prominent query models in the literature have a probabilistic basis, that is, for each term w in the vocabulary, the probability of w, given the query Q,, is computed. This paper introduces an alternative, nonprobabilistic approach to query modelling whereby the strength of information flow is computed between the query Q and the term w. Information flow is a reflection of how strongly w is informationally contained within the query Q. In other words, the basis of the query model generation is information inference. The information flow model is based on Hyperspace Analogue to Language (HAL) vector representations, which reflects the lexical cooccurrence information of terms. Research from cognitive science has demonstrated the cognitive compatibility of HAL representations with human processing, and therefore HAL vectors would thus seem to be a potentially useful basis for inferring query expansion terms. Query models computed from TREC queries by HAL-based information flow are compared experimentally with two probabilistic query language models. Experimental results are provided showing the HAL-based information flow model be superior to query models computed via Markov chains, and seems to be as effective as a probabilistically motivated relevance model.
ISBN: 1581134924
Appears in Collections:Conference publications (Computing)

All items in OpenAIR are protected by copyright, with all rights reserved.


   Disclaimer | Freedom of Information | Privacy Statement |Copyright ©2012 Robert Gordon University, Garthdee House, Garthdee Road, Aberdeen, AB10 7QB, Scotland, UK: a Scottish charity, registration No. SC013781