Retriever: Improving Web Search Engine Results Using Clustering

Retriever: Improving Web Search Engine Results Using Clustering

Anupam Joshi (University of Maryland-Baltimore County, USA) and Zhihua Jiang (American Management Systems, Inc., USA)
Copyright: © 2002 |Pages: 23
DOI: 10.4018/978-1-930708-12-9.ch004
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Web search engines have become increasingly ineffective as the number of documents on the Web have proliferated. Typical queries retrieve hundreds of documents, most of which have no relation with what the user was looking for. The chapter describes a system named Retriever that uses a recently proposed robust fuzzy algorithm RFCMdd to cluster the results of a query from a search engine into groups. These groups and their associated keywords are presented to the user, who can then look into the URLs for the group(s) that s/he finds interesting. This application requires clustering in the presence of a significant amount of noise, which our system can handle efficiently. N-Gram and Vector Space methods are used to create the dissimilarity matrix for clustering. We discuss the performance of our system by comparing it with other state-of-the-art peers, such as Husky search, and present the results from analyzing the effectiveness of the N-Gram and Vector Space methods during the generation of dissimilarity matrices.

Complete Chapter List

Search this Book:
Reset