%0 Conference Paper
%A Haveliwala, Taher
%A Gionis, Aristides
%A Indyk, Piotr
%B Third International Workshop on the Web and Databases (WebDB 2000)
%C Dallas, Texas,
%D 2000
%F ilprints:445
%K WebBase,search,information retrieval,clustering,related pages
%T Scalable Techniques for Clustering the Web (Extended Abstract)
%U http://ilpubs.stanford.edu:8090/445/
%X Clustering is one of the most crucial techniques for dealing with the massive amount of information present on the web.  Clustering can either be performed once offline, independent of search queries, or performed online on the results of search queries.  Our offline approach aims to efficiently cluster similar pages on the web, using the technique of Locality-Sensitive Hashing (LSH), in which web pages are hashed in such a way that similar pages have a much higher probability of collision than dissimilar pages.  Our preliminary experiments on the Stanford WebBase have shown that the hash-based scheme can be scaled to millions of urls.