loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)
A Method of Web Search Result Clustering Based on Rough Sets
Compi?gne University of Technology, France
September 19-September 22
ISBN: 0-7695-2415-X
Chi Lang Ngo, Warsaw University
Hung Son Nguyen, Warsaw University
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.
Index Terms:
rough sets, snippet, clustering
Citation:
Chi Lang Ngo, Hung Son Nguyen, "A Method of Web Search Result Clustering Based on Rough Sets," wi, pp.673-679, 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.