A Clustering Algorithm Based on Generalized Stars

摘要

In this paper we present a new algorithm for document clustering called Generalized Star (Gstar). This algorithm is a generalization of the Star algorithm proposed by Aslam et al., and recently improved by them and other researchers. In this method we introduced a new concept of star allowing a different star-shaped form with better overlapping clusters. The evaluation experiments on standard document collections show that the proposed algorithm outperforms previously defined methods and obtains a smaller number of clusters. Since the Gstar algorithm is relatively simple to implement and is also efficient, we advocate its use for tasks that require clustering, such as information organization, browsing, topic tracking, and new topic detection.