Current position: Home >> Scientific Research >> Paper Publications

Possibilistic Clustering Using Non-Euclidean Distance

Release Time:2019-03-11  Hits:

Indexed by: Conference Paper

Date of Publication: 2009-06-17

Included Journals: Scopus、CPCI-S、EI

Page Number: 938-940

Key Words: Fuzzy Clustering; Possibilistic C-Means; Non-Euclidean Distance

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.

Prev One:Cross-layer optimized data gathering in wireless multimedia sensor networks

Next One:Simulation and Testbed Experiments of a Backoff Differentiation Scheme for Sensor Networks