Orthogonally constrained matrix factorization for robust unsupervised feature selection with local preserving
DOI10.1016/J.INS.2021.11.068OpenAlexW4200121584WikidataQ114167404 ScholiaQ114167404MaRDI QIDQ6154470FDOQ6154470
Authors: Chuan Luo, Jian Zheng, Tianrui Li, Hongmei Chen, Yanyong Huang, Xi Peng
Publication date: 15 February 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2021.11.068
Recommendations
- Unsupervised feature selection by regularized self-representation
- Subspace learning for unsupervised feature selection via matrix factorization
- Unsupervised feature selection through combining graph learning and \(\ell_{2, 0}\)-norm constraint
- Unsupervised feature selection based on local neighborhood embedding
- Scalable and flexible unsupervised feature selection
matrix factorizationunsupervised feature selectionorthogonal constraints\(\ell_2 1\)-normlocal preserving
Cites Work
Cited In (5)
- Dual-dual subspace learning with low-rank consideration for feature selection
- Robust autoencoder feature selector for unsupervised feature selection
- Deep unsupervised feature selection by discarding nuisance and correlated features
- Unsupervised feature selection through combining graph learning and \(\ell_{2, 0}\)-norm constraint
- Dual-level feature assessment for unsupervised multi-view feature selection with latent space learning
This page was built for publication: Orthogonally constrained matrix factorization for robust unsupervised feature selection with local preserving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154470)