A feature group weighting method for subspace clustering of high-dimensional data
From MaRDI portal
Recommendations
Cites work
- An optimization algorithm for clustering using weighted dissimilarity measures
- Clustering Objects on Subsets of Attributes (with Discussion)
- Developing a feature weight self-adjustment mechanism for a K-means clustering algorithm
- Enhanced soft subspace clustering integrating within-cluster and between-cluster information
- Feature weighting in \(k\)-means clustering
- High-dimensional data clustering
- Model-based subspace clustering
- Synthesized clustering: A method for amalgamating alternative clustering bases with differential weighting of variables
Cited in
(16)- A novel soft subspace clustering algorithm with noise detection for high dimensional datasets
- Robust and sparse \(k\)-means clustering for high-dimensional data
- Weighted random subspace method for high dimensional data classification
- Novel soft subspace clustering with multi-objective evolutionary approach for high-dimensional data
- A general framework for subspace detection in unordered multidimensional data
- Unsupervised feature selection with ensemble learning
- Enhanced balanced min cut
- Feature interaction in subspace clustering using the Choquet integral
- A survey on soft subspace clustering
- Transfer learning-assisted multi-objective evolutionary clustering framework with decomposition for high-dimensional data
- wskm
- Subspace clustering with automatic feature grouping
- Reliability-based regularized weighted soft \(k\)-means algorithm for subspace clustering
- Enhanced soft subspace clustering through hybrid dissimilarity
- A survey on feature weighting based K-means algorithms
- Distance metric learning for soft subspace clustering in composite kernel space
This page was built for publication: A feature group weighting method for subspace clustering of high-dimensional data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q139002)
