Affiliations: [a] Computer Science Department, National Institute of Astrophysics, Puebla, Mexico | [b] Advanced Technologies Application Center, Siboney, Playa, Havana, Cuba
Correspondence:
[*]
Corresponding author: Airel Pérez-Suárez, Computer Science Department, National Institute of Astrophysics, Optics and Electronics Luis Enrique Erro ♯1, Sta. María Tonantzintla, Puebla, CP: 72840, Mexico. E-mail: [email protected]
Abstract: Clustering is a Data Mining technique which has been widely used in many practical applications. In some of these applications like, medical diagnosis, categorization of digital libraries, topic detection and others, the objects could belong to more than one cluster. However, most of the clustering algorithms generate disjoint clusters. Moreover, processing additions, deletions and modifications of objects in the clustering built so far, without having to rebuild the clustering from the beginning is an issue that has been little studied. In this paper, we introduce DCS, a clustering algorithm which includes a new graph-cover strategy for building a set of clusters that could overlap, and a strategy for dynamically updating the clustering, managing multiple additions and/or deletions of objects. The experimental evaluation conducted over different collections demonstrates the good performance of the proposed algorithm.
Keywords: Data mining, overlapping clustering, graph-based algorithms
