Scalable and flexible unsupervised feature selection
From MaRDI portal
Recommendations
- A factor graph model for unsupervised feature selection
- Unsupervised feature selection by regularized self-representation
- Low-rank unsupervised feature selection based on self-representation
- Unsupervised feature selection using structured self-representation
- A robust graph-based semi-supervised sparse feature selection method
Cites work
- A Weight-Adaptive Laplacian Embedding for Graph-Based Clustering
- Feature Selection for Ridge Regression with Provable Guarantees
- Feature selection for unsupervised learning
- Flexible Manifold Embedding: A Framework for Semi-Supervised and Unsupervised Dimension Reduction
- Multi-label learning with missing labels using mixed dependency graphs
- Multiview Feature Analysis via Structured Sparsity and Shared Subspace Discovery
- Tensor semantic model for an audio classification system
Cited in
(18)- Unsupervised feature selection by regularized self-representation
- A factor graph model for unsupervised feature selection
- Unsupervised feature selection for efficient exploration of high dimensional data
- Unsupervised feature selection with ensemble learning
- Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection
- scientific article; zbMATH DE number 6719239 (Why is no real title available?)
- scientific article; zbMATH DE number 5957308 (Why is no real title available?)
- Unsupervised feature selection using structured self-representation
- Low-rank unsupervised feature selection based on self-representation
- Unsupervised feature selection via adaptive autoencoder with redundancy control
- Deep unsupervised feature selection by discarding nuisance and correlated features
- An efficient feature selection algorithm based on the description vector and hypergraph
- Streaming feature selection via graph diffusion
- Orthogonally constrained matrix factorization for robust unsupervised feature selection with local preserving
- Fast unsupervised embedding learning with anchor-based graph
- Fast spectral clustering with self-adapted bipartite graph learning
- Unsupervised feature selection through combining graph learning and \(\ell_{2, 0}\)-norm constraint
- Unsupervised feature selection via dual space-based low redundancy scores and extended OLSDA
This page was built for publication: Scalable and flexible unsupervised feature selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154124)
