4.7 Article

Fuzzy K-Means Clustering With Discriminative Embedding

Journal

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
Volume 34, Issue 3, Pages 1221-1230

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2020.2995748

Keywords

Clustering algorithms; Linear programming; Clustering methods; Principal component analysis; Noise measurement; Dimensionality reduction; Task analysis; Fuzzy K-Means; dimensionality reduction; most information; principal component analysis

Funding

  1. National Key Research and Development Program of China [2018AAA0101902, 2018YFB1403500]
  2. National Natural Science Foundation of China [61772427, 61751202, 61936014]
  3. Fundamental Research Funds for the Central Universities [G2019KY0501]

Ask authors/readers for more resources

Fuzzy K-Means (FKM) clustering is an important method for analyzing unlabeled data. Current methods may lead to suboptimal results due to the influence of noises and redundant features, as well as ignoring the importance of the weighting exponent. In this paper, a novel FKM method is proposed that conducts dimensionality reduction and fuzzy membership degree learning simultaneously, incorporating principal component analysis for improved robustness.
Fuzzy K-Means (FKM) clustering is of great importance for analyzing unlabeled data. FKM algorithms assign each data point to multiple clusters with some degree of certainty measured by the membership function. In these methods, the fuzzy membership degree matrix is obtained based on the calculation of the distance between data points in the original space. However, this operation may lead to suboptimal results because of the influence of noises and redundant features. Besides, some FKM clustering methods ignore the importance of the weighting exponent. In this paper, we propose a novel FKM method called Fuzzy K-Means Clustering With Discriminative Embedding. Within this method, we simultaneously conduct dimensionality reduction along with fuzzy membership degree learning. To retain most information in the embedding subspace and improve the robustness of this method, principal component analysis is incorporated into our framework. An iterative optimization algorithm is proposed to solve the model. To validate the efficacy of the proposed method, we perform comprehensive analyses, including convergence behavior, parameter determination and computational complexity. Moreover, we also match a appropriate weighting exponent for each data set. Experimental results on benchmark data sets show that the proposed method is more discriminative and effective for clustering tasks.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available