基于改进后缀树算法中英文聚类引擎的实现

Implementation of Chinese and English Clustering Engine Based on Improved Suffix Tree Algorithm

提出一种基于改进后缀树与交互聚类思想相结合的算法ISTC算法,通过改造传统后缀树结构实现了对文档标题和摘要的层次化聚类,同时用交互聚类的方式替代了传统的递归算法.ISTC算法具有语言无关性,不仅适用于基于单词的西方文字,而且可以在不引入词典分词技术的情况下有效地处理基于单字的中文字符.在此算法基础上,设计并实现了基于改进后缀树算法的交互聚类引擎,在不同的网络环境下对其进行了系统测试,并与其他元搜索引擎进行了对比.实验结果表明,使用改进后缀树算法进行实时交互式聚类是可行的.

This paper presents an algorithm based on the improved suffix tree and interact-clustering idea. Hierarchical clustering for document title and summary is implemented by improved traditional suffix tree structure. Meanwhile, the interactive clustering is employed instead of traditional recursive algorithm. The algorithm is not related with language. Not only is it applicable to word-based English, but also it can deal effectively with character-based Chinese without dictionary-based Chinese word segmentation. Furthermore, the interactive clustering engine was realized on the basis of the algorithm, the system was tested in different network environments, and the experimemnt demonstrates that improved suffix tree algorithm. performance of the system was compared wi it is feasible effectively to conduct real-time th other meta-search engines. The interactive clustering by using the