• Home
  • Search
  • Feature Selection Embedded Robust K-Means
  • Cite Icon6
  • https://doi.org/10.1109/access.2020.3022749Copy DOI Icon

Feature Selection Embedded Robust K-Means

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Clustering is one of the most important unsupervised learning problems in machine learning. As one of the most widely used clustering algorithms, K-means has been studied extensively. A number of more complicated and advanced clustering algorithms have been developed based on K-means. Moreover, K-means is often used as a final clustering step in many algorithms, such as subspace clustering, nonnegative matrix factorization, etc. However, for high-dimensional data, these algorithms generally use all features of the data, which often degrades the clustering performance due to the use of redundant and noisy information. Existing researches have demonstrated the importance of learning patterns with meaningful features, which inspires us to simultaneously discover useful features in the K-means framework. Thus, in this article, we incorporate feature selection into K-means framework. Moreover, to further enhance the clustering ability, we minimize the fitting residual with sparse norm and exploit the representation on manifold, which enhances the robustness to outliers, missing values, and noise and improves the ability to recover nonlinear structures of the data. We conducted extensive experiments to testify the effectiveness of the proposed method on gene expression and face image data sets. In particular, we compare the clustering performance with several state-of-the art algorithms on both original data and noisy data. We also analyze the convergence, parameter sensitivity, learned features, and computational time of the proposed method. From extensive experimental results, we observe superior clustering performance to the baseline methods, which implies the effectiveness of the proposed method.

Similar Papers
  • Research Article
  • Citations24

Autoencoder-Based Latent Block-Diagonal Representation for Subspace Clustering.

  • Jun 01, 2022
  • IEEE Transactions on Cybernetics
  • Yesong Xu +4
  • Conference Article
  • Citations2

NMF based gene selection algorithm for improving performance of the spectral cancer clustering

  • Nov 01, 2013
  • Andri Mirzal
  • Research Article
  • Citations10

Minority manifold regularization by stacked auto-encoder for imbalanced learning

  • Nov 17, 2020
  • Expert Systems with Applications
  • Nima Farajian +1
  • Conference Article

Multi-view Fuzzy Clustering Algorithm Based on Non-Negative Matrix Factorization and Partition Adaptive Fusion

  • Dec 20, 2019
  • Xingliu Tao +2
  • Conference Article
  • Citations196

Self-Supervised Convolutional Subspace Clustering Network

  • Jun 01, 2019
  • Junjian Zhang +6
  • Book Chapter
  • Citations1

Automatic Non-negative Matrix Factorization Clustering with Competitive Sparseness Constraints

  • Jan 01, 2014
  • Chenglin Liu +1
  • Conference Article
  • Citations3

Performance Analysis and Benchmarking of Clustering Algorithms with gene datasets

  • May 01, 2019
  • Meskat Jahan +1
  • Research Article
  • Citations76

Multi-view data clustering via non-negative matrix factorization with manifold regularization

  • Mar 21, 2021
  • International Journal of Machine Learning and Cybernetics
  • Ghufran Ahmad Khan +4
  • Research Article
  • Citations10

Nonlinear subspace clustering by functional link neural networks

  • Oct 05, 2024
  • Applied Soft Computing
  • Long Shi +4
  • Research Article
  • Citations9

Projection subspace clustering

  • May 02, 2017
  • Journal of Algorithms & Computational Technology
  • Xiaoyun Chen +2
  • Research Article
  • Citations13

Benchmarking the Clustering Performances of Evolutionary Algorithms: A Case Study on Varying Data Size

  • Jun 25, 2020
  • IRBM
  • F Kayaalp +1
  • PDF
  • Research Article
  • Citations4

Impact Parameter Analysis of Subspace Clustering

  • Sep 01, 2015
  • International Journal of Distributed Sensor Networks
  • Dongjin Lee +1
  • Research Article
  • Citations10

Simulated annealing spectral clustering algorithm for image segmentation

  • Jun 01, 2014
  • Journal of Systems Engineering and Electronics
  • Yifang Yang +1
  • Research Article
  • Citations209

Graph Regularized Non-Negative Low-Rank Matrix Factorization for Image Clustering

  • Jul 20, 2016
  • IEEE Transactions on Cybernetics
  • Xuelong Li +2
  • Research Article

ℓp-Sphere Covering and Approximating Nuclear p-Norm

  • Dec 09, 2024
  • Mathematics of Operations Research
  • Jiewen Guan +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.