A robust unsupervised feature selection based on subspace learning and adaptive graph structure
From MaRDI portal
Cites work
- Comparing clusterings -- an information based distance
- Feature selection for unsupervised learning
- scientific article; zbMATH DE number 3169932 (Why is no real title available?)
- Multiple discriminant preserving support subspace RBFNNs with graph similarity learning
- Nonlinear programming
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- Robust local-coordinate non-negative matrix factorization with adaptive graph for robust clustering
- Robust multi-view non-negative matrix factorization with adaptive graph and diversity constraints
- Simultaneous Dimensionality Reduction and Classification via Dual Embedding Regularized Nonnegative Matrix Factorization
- Subspace learning for unsupervised feature selection via matrix factorization
This page was built for publication: A robust unsupervised feature selection based on subspace learning and adaptive graph structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305588)
