Suffix tree clustering algorithm in the meta search engine
Tianqi Yang · Microcomputer Information · 2010
Meta search engine has many advantage,its retrieve results corver a wide range,it easy to maintain and achieve,it also can provide a more comprehensive results to users. Suffix tree clustering algorithm (STC) does not treat a document as a set of word but rather as a string,making use of proximity information between words,so it has a good clustering effect. Suffix tree clustering algorithm applied to the meta search engine,thus enhancing the browsing of retrieve results,improving the accuracy of the retrieve results.The experimental results show that STC algorithm has a better performance than traditional clustering algorithm.