By Topic

Web Snippets Clustering Based on an Improved Suffix Tree Algorithm

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
$33 $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)
Han Wen ; Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China ; Nan-Feng Xiao ; Qiong Chen

Web search results clustering is the navigator for users to find relevant results quickly. Through combining the advantages of vector space model (VSM) and suffix tree clustering (STC) document models, this paper puts forward a more effective Web snippets clustering algorithm. It can take into account the semantic information of candidate label phrases, and offer descriptive, readable and conceptual topic labels for the final documents groups. Evaluation of results demonstrates that clustering Web snippets based on the improved suffix tree algorithm has better performance in making search engine results easy to browse and helping users quickly find Web pages that they are interested in.

Published in:

Fuzzy Systems and Knowledge Discovery, 2009. FSKD '09. Sixth International Conference on  (Volume:1 )

Date of Conference:

14-16 Aug. 2009