By Topic

Query Expansion based on Concept Clique for Markov Network Information Retrieval Model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Lixin Gan ; Key Lab. of Opt.-Electron. &Commun., Jiangxi Sci. & Technol. Normal Univ., Nanchang ; Shengqian Wang ; Mingwen Wang ; Zhihua Xie
more authors

Query expansion is a common technique used to improve retrieval effectiveness. In this paper, we propose a novel query expansion technique based on concept clique for Markov network information retrieval model. This technique strengthens the simple relationships between terms in the following two ways:(1) terms in a clique express a similar concept and will be added into query expansion, so that it is effective to expanded into some terms with low similar to query terms but highly related to query topic; (2) query term dependencies are used to select concept cliques as candidates. The selection of concept cliques based on a connected graph is effective to avoid topic drift during expanding polysemous query terms. Experiments on several collections show that new approach makes significant improvements and more effective on collections with polysemous terms.

Published in:

Fuzzy Systems and Knowledge Discovery, 2008. FSKD '08. Fifth International Conference on  (Volume:5 )

Date of Conference:

18-20 Oct. 2008