Unsupervised feature selection by regularized self-representation
From MaRDI portal
Recommendations
- Unsupervised feature selection using structured self-representation
- Low-rank unsupervised feature selection based on self-representation
- Feature selection for unsupervised learning
- Unsupervised feature selection via adaptive autoencoder with redundancy control
- Scalable and flexible unsupervised feature selection
Cites work
- scientific article; zbMATH DE number 1250597 (Why is no real title available?)
- 10.1162/153244303322753616
- A Review of Image Denoising Algorithms, with a New One
- Constraint score: A new filter method for feature selection with pairwise constraints
- Feature selection for unsupervised learning
- Unsupervised feature selection using clustering ensembles and population based incremental learning algorithm
Cited in
(24)- The \(L_{2,1}\)-norm-based unsupervised optimal feature selection with applications to action recognition
- Streaming feature selection via graph diffusion
- Deep random walk of unitary invariance for large-scale data representation
- A factor graph model for unsupervised feature selection
- Hierarchical unsupervised multi-view feature selection
- Feature Selection Using Games with Imperfect Information (FSGIN)
- Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data
- Locality preserving score for joint feature weights learning
- Low-rank unsupervised feature selection based on self-representation
- Unsupervised feature selection through combining graph learning and \(\ell_{2, 0}\)-norm constraint
- Unsupervised feature selection using structured self-representation
- Unsupervised feature selection based on kernel Fisher discriminant analysis and regression learning
- Unsupervised feature selection based on local neighborhood embedding
- Label distribution learning by regularized sample self-representation
- Unsupervised feature selection via adaptive autoencoder with redundancy control
- A novel feature selection approach based on clustering algorithm
- Unsupervised feature selection method based on adaptive locality preserving projection
- Robust autoencoder feature selector for unsupervised feature selection
- An efficient semi-supervised representatives feature selection algorithm based on information theory
- Scalable and flexible unsupervised feature selection
- Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection
- Deep unsupervised feature selection by discarding nuisance and correlated features
- Orthogonally constrained matrix factorization for robust unsupervised feature selection with local preserving
- Weighted fuzzy C-means: unsupervised feature selection to realize a target partition
This page was built for publication: Unsupervised feature selection by regularized self-representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677074)