By Topic

Clustering search engine query log containing noisy clickthroughs

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

3 Author(s)
Wing Shun Chan ; Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Kowloon, China ; Wai Ting Leung ; Lee, D.L.

Query clustering is a technique for discovering similar queries on a search engine. In this paper, we present a query clustering method based on the agglomerative clustering algorithm. We first present an overview of the agglomerative clustering algorithm proposed by Beeferman and Berger (2000). We point out a weakness of the method caused by noisy user clicks and propose an improved clustering algorithm. Our results show that in general the agglomerative clustering algorithm can cluster similar queries effectively and that our improved algorithm can successful eliminate noisy clicks and produce cleaner query clusters.

Published in:

Applications and the Internet, 2004. Proceedings. 2004 International Symposium on

Date of Conference: