A possibilistic density based clustering for discovering clusters of arbitrary shapes and densities in high dimensional data

  • Authors:

  • Noha A. Yousri;Mohamed S. Kamel;Mohamed A. Ismail

  • Affiliations:

  • Computer and System Engineering, Faculty of Engineering, Alexandria University, Egypt,Bioinformatics Core, Weill Cornell Medical College, Qatar;PAMI, University of Waterloo, Waterloo, Ontario, Canada;Computer and System Engineering, Faculty of Engineering, Alexandria University, Egypt

  • Venue:
  • ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Apart from the interesting problem of finding arbitrary shaped clusters of different densities, some applications further introduce the challenge of finding overlapping clusters in the presence of outliers. Fuzzy and possibilistic clustering approaches have therefore been developed to handle such problem, where possibilistic clustering is able to handle the presence of outliers compared to its fuzzy counterpart. However, current known fuzzy and possibilistic algorithms are still inefficient to use for finding the natural cluster structure. In this work, a novel possibilistic density based clustering approach is introduced, to identify the degrees of typicality of patterns to clusters of arbitrary shapes and densities. Experimental results illustrate the efficiency of the proposed approach compared to related algorithms.