• DocumentCode
    2782717
  • Title

    Possibilistic clustering using non-Euclidean distance

  • Author

    Wu, Bin ; Wang, Lei ; Xu, Cunliang

  • Author_Institution
    Sch. of Software, Dalian Univ. of Technol., Dalian, China
  • fYear
    2009
  • fDate
    17-19 June 2009
  • Firstpage
    938
  • Lastpage
    940
  • Abstract
    This paper presents a novel fuzzy clustering algorithm called novel possibilistic c-means (NPCM) clustering algorithm. Possibilistic c-means model (PCM) has been proposed by Krishnapuram and Keller to resist noises. It is claimed that NPCM is the extension of PCM by introducing a non-Euclidean distance into PCM to replace the Euclidean distance used in PCM. Based on robust statistical point of view and influence function, the non-Euclidean distance is more robust than the Euclidean distance. So the NPCM algorithm is more robust than PCM. Moreover, with the new distance NPCM can deal with noises or outliers better than PCM and fuzzy c-means (FCM). The experimental results show the better performance of NPCM.
  • Keywords
    fuzzy set theory; pattern clustering; fuzzy clustering; nonEuclidean distance; novel possibilistic c-means clustering algorithm; possibilistic c-means model; possibilistic clustering; Clustering algorithms; Euclidean distance; Fuzzy sets; Noise robustness; Partitioning algorithms; Phase change materials; Prototypes; Resists; Software algorithms; Statistics; Fuzzy Clustering; Non-Euclidean Distance; Possibilistic C-Means;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Decision Conference, 2009. CCDC '09. Chinese
  • Conference_Location
    Guilin
  • Print_ISBN
    978-1-4244-2722-2
  • Electronic_ISBN
    978-1-4244-2723-9
  • Type

    conf

  • DOI
    10.1109/CCDC.2009.5191912
  • Filename
    5191912