By Topic

Interactive Query Expansion With the Use of Clustering-by-Directions Algorithm

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

1 Author(s)
Kaczmarek, A.L. ; Fac. of Electron., Telecommun. & Inf., Gdansk Univ. of Technol., Gdansk, Poland

This paper concerns clustering-by-directions algorithm. The algorithm introduces a novel approach to interactive query expansion. It is designed to support users of search engines in forming Web search queries. When a user executes a query, the algorithm shows potential directions in which the search can be continued. This paper describes the algorithm, and it presents an enhancement which reduces the computational complexity of the algorithm. Moreover, in this paper, a new type of interface is introduced. It is based on a tag cloud, in which terms are located in a radial arrangement. This paper also presents the new experimental results and the evaluation of the algorithm.

Published in:

Industrial Electronics, IEEE Transactions on  (Volume:58 ,  Issue: 8 )