Convex Non-Negative Matrix Factorization With Adaptive Graph for Unsupervised Feature Selection
Published 2020 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Convex Non-Negative Matrix Factorization With Adaptive Graph for Unsupervised Feature Selection
Authors
Keywords
-
Journal
IEEE Transactions on Cybernetics
Volume 52, Issue 6, Pages 5522-5534
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Online
2020-11-26
DOI
10.1109/tcyb.2020.3034462
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Dimensionality Reduction With Enhanced Hybrid-Graph Discriminant Learning for Hyperspectral Image Classification
- (2020) Fulin Luo et al. IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING
- Unsupervised Feature Selection via Adaptive Multimeasure Fusion
- (2019) Rui Zhang et al. IEEE Transactions on Neural Networks and Learning Systems
- Sparse-Adaptive Hypergraph Discriminant Analysis for Hyperspectral Image Classification
- (2019) Fulin Luo et al. IEEE Geoscience and Remote Sensing Letters
- Subspace clustering guided convex nonnegative matrix factorization
- (2018) Guosheng Cui et al. NEUROCOMPUTING
- Structure preserving unsupervised feature selection
- (2018) Quanmao Lu et al. NEUROCOMPUTING
- Feature Learning Using Spatial-Spectral Hypergraph Discriminant Analysis for Hyperspectral Image
- (2018) Fulin Luo et al. IEEE Transactions on Cybernetics
- Adaptive Structure Discovery for Multimedia Analysis Using Multiple Features
- (2018) Kun Zhan et al. IEEE Transactions on Cybernetics
- Graph Structure Fusion for Multiview Clustering
- (2018) Kun Zhan et al. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
- Generalized Uncorrelated Regression with Adaptive Graph for Unsupervised Feature Selection
- (2018) Xuelong Li et al. IEEE Transactions on Neural Networks and Learning Systems
- Multiview Consensus Graph Clustering
- (2018) Kun Zhan et al. IEEE TRANSACTIONS ON IMAGE PROCESSING
- A generalized power iteration method for solving quadratic problem on the Stiefel manifold
- (2017) Feiping Nie et al. Science China-Information Sciences
- Self-Weighted Supervised Discriminative Feature Selection
- (2017) Rui Zhang et al. IEEE Transactions on Neural Networks and Learning Systems
- Feature Selection Based on Structured Sparsity: A Comprehensive Study
- (2017) Jie Gui et al. IEEE Transactions on Neural Networks and Learning Systems
- Robust Joint Graph Sparse Coding for Unsupervised Spectral Feature Selection
- (2017) Xiaofeng Zhu et al. IEEE Transactions on Neural Networks and Learning Systems
- Graph Learning for Multiview Clustering
- (2017) Kun Zhan et al. IEEE Transactions on Cybernetics
- An unsupervised feature selection algorithm based on ant colony optimization
- (2014) Sina Tabakhi et al. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
- Speeding up incremental wrapper feature subset selection with Naive Bayes classifier
- (2013) Pablo Bermejo et al. KNOWLEDGE-BASED SYSTEMS
- A novel method for recognizing face with partial occlusion via sparse representation
- (2013) Jian-Xun Mi et al. OPTIK
- Joint Embedding Learning and Sparse Regression: A Framework for Unsupervised Feature Selection
- (2013) Chenping Hou et al. IEEE Transactions on Cybernetics
- Face recognition via Weighted Sparse Representation
- (2012) Can-Yi Lu et al. JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION
- Discriminative Semi-Supervised Feature Selection Via Manifold Regularization
- (2010) Zenglin Xu et al. IEEE TRANSACTIONS ON NEURAL NETWORKS
- A wrapper method for feature selection using Support Vector Machines
- (2009) Sebastián Maldonado et al. INFORMATION SCIENCES
- Supervised feature selection by clustering using conditional mutual information-based distances
- (2009) José Martínez Sotoca et al. PATTERN RECOGNITION
Add your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload NowAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started