A new overlapping clustering algorithm based on graph theory

Abstract

Most of the clustering algorithms reported in the literature build disjoint clusters; however, there are several applications where overlapping clustering is useful and important. Although several overlapping clustering algorithms have been proposed, most of them have a high computational complexity or they have some limitations which reduce their usefulness in real problems. In this paper, we introduce a new overlapping clustering algorithm, which solves the limitations of previous algorithms, while it has an acceptable computational complexity. The experimentation, conducted over several standard collections, demonstrates the good performance of the proposed algorithm. © 2013 Springer-Verlag.