A New Incremental Algorithm for Overlapped Clustering

  • Authors:
  • Airel Pérez Suárez;José Fco. Trinidad;Jesús A. Ochoa;José E. Medina Pagola

  • Affiliations:
  • National Institute for Astrophysics,Optics and Electronics (INAOE), Mexico and Advanced Technologies Application Center, (CENATAV), Cuba;National Institute for Astrophysics,Optics and Electronics (INAOE), Mexico;National Institute for Astrophysics,Optics and Electronics (INAOE), Mexico;Advanced Technologies Application Center, (CENATAV), Cuba

  • Venue:
  • CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a new algorithm for incremental overlapped clustering, called Incremental Clustering by Strength Decision (ICSD), is introduced. ICSD obtains a set of dense and overlapped clusters using a new graph cover heuristic while reduces the amount of computation by maintaining incrementally the cluster structure. The experimental results show that our proposal outperforms other graph-based clustering algorithms considering quality measures and also show that ICSD achieves a better time performance than other incremental graph-based algorithms.