Indexed by:Conference Paper

Date of Publication:2008-07-08

Included Journals:Scopus、CPCI-S、EI

Page Number:110-115

Abstract:Searching for information by search engines has been gaining popularity in recent years. However, results returned by most Chinese Web search engines usually reach up to thousands or even millions documents, so search results clustering is of critical need for on-line grouping of similar documents to improve user experience while searching collections of Web pages and facilitate browsing Chinese Web pages in a more compact and thematic form. This paper presents a new Suffix Tree Clustering (STC) algorithm for Web search results clustering, which is more suitable for Chinese context. It is built in terms of Chinese words, of which meaningless phrases are ignored by an efficient strategy we proposed Meanwhile the Chinese synonymy is introduced into the suffix free to improve the quality of the clusters. Experiments show that the proposed novel STC algorithm has a better performance in precision and speed than original STC.