A Method of Web Search Result Clustering Based on Rough Sets

Due to the enormous size of the web and low precision of user queries, finding the right information from the web can be difficult if not impossible. One approach that tries to solve this problem is using clustering techniques for grouping similar document together in order to facilitate presentation of results in more compact form and enable thematic browsing of the results set. The main problem of many web search result (snippet) clustering algorithm is based on the poor vector representation of snippets. In this paper, we present a method of snippet representation enrichment using Tolerance Rough Set model. We applied the proposed method to construct a rough set based search result clustering algorithm and compared it with other recent methods.

• Type: Conference
• Year: 2005
• Where: WEBI
• Authors: Chi Lang Ngo, Hung Son Nguyen
• Keywords: Clustering Algorithm, Internet Technology, Rough Set, Snippet Representation Enrichment, WEBI 2005