Deep random walk of unitary invariance for large-scale data representation
From MaRDI portal
Publication:2124155
Recommendations
- Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data
- Orthogonal self-guided similarity preserving projection for classification and clustering
- Low-rank unsupervised feature selection based on self-representation
- Unsupervised feature selection by regularized self-representation
- SVD representation of unitarily invariant matrices
Cites work
- Canonical Correlation Analysis: An Overview with Application to Learning Methods
- Discerning Feature Supported Encoder for Image Representation
- Joint dimensionality reduction and metric learning for image set classification
- Learning robust affinity graph representation for multi-view clustering
- Learning the parts of objects by non-negative matrix factorization
- Link prediction based on feature representation and fusion
- MVSNet++: Learning Depth-Based Attention Pyramid Features for Multi-View Stereo
- Matrix theory
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Rank-constrained nonnegative matrix factorization for data representation
- Reducing the Dimensionality of Data with Neural Networks
- Robust Manhattan non-negative matrix factorization for image recovery and representation
- Robust sparse coding via self-paced learning for data representation
- Subspace learning for unsupervised feature selection via matrix factorization
This page was built for publication: Deep random walk of unitary invariance for large-scale data representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124155)