A survey on soft subspace clustering
From MaRDI portal
Publication:1991836
Abstract: Subspace clustering (SC) is a promising clustering technology to identify clusters based on their associations with subspaces in high dimensional spaces. SC can be classified into hard subspace clustering (HSC) and soft subspace clustering (SSC). While HSC algorithms have been extensively studied and well accepted by the scientific community, SSC algorithms are relatively new but gaining more attention in recent years due to better adaptability. In the paper, a comprehensive survey on existing SSC algorithms and the recent development are presented. The SSC algorithms are classified systematically into three main categories, namely, conventional SSC (CSSC), independent SSC (ISSC) and extended SSC (XSSC). The characteristics of these algorithms are highlighted and the potential future development of SSC is also discussed.
Recommendations
- scientific article; zbMATH DE number 5951453
- Enhanced soft subspace clustering through hybrid dissimilarity
- scientific article; zbMATH DE number 6961881
- Enhanced soft subspace clustering integrating within-cluster and between-cluster information
- A survey on enhanced subspace clustering
- Multi-objective soft subspace clustering in the composite kernel space
- A novel soft subspace clustering algorithm with noise detection for high dimensional datasets
- Subspace clustering through sub-clusters
Cites work
- A clustering ensemble framework based on elite selection of weighted clusters
- A convergence theorem for the fuzzy subspace clustering (FSC) algorithm
- A feature group weighting method for subspace clustering of high-dimensional data
- A novel attribute weighting algorithm for clustering high-dimensional categorical data
- A survey on enhanced subspace clustering
- An optimization algorithm for clustering using weighted dissimilarity measures
- Another interpretation of the EM algorithm for mixture distributions
- Clustering Objects on Subsets of Attributes (with Discussion)
- Comparison between two coevolutionary feature weighting algorithms in clustering
- Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
- Double indices-induced FCM clustering and its integration with fuzzy subspace clustering
- Enhanced soft subspace clustering integrating within-cluster and between-cluster information
- Factorial k-means analysis for two-way data.
- Factorial and reduced \(K\)-means reconsidered
- Feature weighting in \(k\)-means clustering
- Fuzzy clustering with weighting of data variables
- Optimal variable weighting for ultrametric and additive trees and \(K\)-means partitioning: Methods and software.
- Projective clustering ensembles
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Subspace clustering with automatic feature grouping
- Synthesized clustering: A method for amalgamating alternative clustering bases with differential weighting of variables
Cited in
(16)- Coupled block diagonal regularization for multi-view subspace clustering
- Multiple kernel low-rank representation-based robust multi-view subspace clustering
- Orthogonal self-guided similarity preserving projection for classification and clustering
- Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity
- Robust low-rank kernel multi-view subspace clustering based on the Schatten \(p\)-norm and correntropy
- Joint correntropy metric weighting and block diagonal regularizer for robust multiple kernel subspace clustering
- A proximal framework for fuzzy subspace clustering
- Transfer learning-assisted multi-objective evolutionary clustering framework with decomposition for high-dimensional data
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- scientific article; zbMATH DE number 5951453 (Why is no real title available?)
- scientific article; zbMATH DE number 1406080 (Why is no real title available?)
- Topological biclustering ARTMAP for identifying within bicluster relationships
- Multi-objective soft subspace clustering in the composite kernel space
- On efficient model selection for sparse hard and fuzzy center-based clustering algorithms
- Novel soft subspace clustering with multi-objective evolutionary approach for high-dimensional data
This page was built for publication: A survey on soft subspace clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991836)
