A Robust Possibilistic Clustering Algorithm
博士 === 中原大學 === 應用數學研究所 === 98 === Krishnapuram and Keller (1993) first proposed a possibilistic approach to clustering, called possibilistic c-means (PCM), by relaxing the constraint in fuzzy c-means (FCM) that the memberships of a data point across classes sum to 1. The PCM algorithm has a tendenc...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/45186783961780903545 |