By Topic

The optimal algorithm for query refinement in information retrieval

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
$33 $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

1 Author(s)
Y. Maeda ; Media Process. Project, NTT Cyberspace Labs., Kanagawa, Japan

To realize more efficient information retrieval it is critical to improve the user's original query, because novice users can not be expected to formulate precise and effective queries. Queries can often be improved by adding extra terms that appear in relevant documents but which are not included in the original query. This is called query expansion. Query refinement, a variant of query expansion, interactively recommends new terms related to the original query. Since previous research did not offer any criterion to guarantee optimality, this paper proposes an optimal algorithm for query refinement with reference to the Bayes criterion

Published in:

Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on  (Volume:5 )

Date of Conference: