An Aspect Query Language Model Based On Query Decomposition And High-Order Contextual Term Associations

  • Authors:

  • Dawei Song;Qiang Huang;Peter Bruza;Raymond Lau

  • Affiliations:

  • School of Computing, The Robert Gordon University, Aberdeen, United Kingdom/ and School of Computer Science and Technology, Tianjin University, P.R. China;School of Computing Sciences, University of East Anglia, Norwich, United Kingdom;Faculty of Information Technology, Queensland University of Technology, Brisbane, Australia;Department of Information Systems, City University of Hong Kong, Hong Kong, P.R. China

  • Venue:
  • Computational Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In information retrieval (IR) research, more and more focus has been placed on optimizing a query language model by detecting and estimating the dependencies between the query and the observed terms occurring in the selected relevance feedback documents. In this paper, we propose a novel Aspect Language Modeling framework featuring term association acquisition, document segmentation, query decomposition, and an Aspect Model (AM) for parameter optimization. Through the proposed framework, we advance the theory and practice of applying high-order and context-sensitive term relationships to IR. We first decompose a query into subsets of query terms. Then we segment the relevance feedback documents into chunks using multiple sliding windows. Finally we discover the higher order term associations, that is, the terms in these chunks with high degree of association to the subsets of the query. In this process, we adopt an approach by combining the AM with the Association Rule (AR) mining. In our approach, the AM not only considers the subsets of a query as “hidden” states and estimates their prior distributions, but also evaluates the dependencies between the subsets of a query and the observed terms extracted from the chunks of feedback documents. The AR provides a reasonable initial estimation of the high-order term associations by discovering the associated rules from the document chunks. Experimental results on various TREC collections verify the effectiveness of our approach, which significantly outperforms a baseline language model and two state-of-the-art query language models namely the Relevance Model and the Information Flow model. © 2012 Wiley Periodicals, Inc.