Feature-Weighted Possibilistic c-Means Clustering With a Feature-Reduction Framework

摘要

In 1993, Krishnapuram and Keller proposed possibilistic c-means (PCM) clustering, where the PCM had various extensions in the literature. However, the PCM algorithm with its extensions treats data points under equal importance for features. In real applications, different features in a dataset should take different importance with different weights. In this article, we first propose a feature-weighted PCM (FW-PCM). We then construct a feature-reduction framework. Therefore, we give a feature-weighted possibilistic c-means clustering with a feature-reduction framework, termed as a feature-weighted reduction PCM (FW-R-PCM) algorithm. The proposed FW-R-PCM can improve the clustering performance of PCM by calculating feature weights to identify important features, and so it can consequently eliminate these irrelevant features to reduce feature dimension. Its theoretical behavior and computational complexity are also analyzed. The effectiveness and usefulness of FW-R-PCM are demonstrated through experimental results using synthetic and real datasets, where comparisons of FW-R-PCM with PCM, FW-PCM, and some existing feature-weighted clustering algorithms are also made.