← Core Methods
Machine Learning › Core Methods ›

Dimensionality Reduction

706 directly classified papers

Papers per year

Papers

Forecastable Component Analysis ICML 2013
Canonical Correlation Analysis based on Hilbert-Schmidt Independence Criterion and Centered Kernel Target Alignment ICML 2013
Markov Network Estimation From Multi-attribute Data ICML 2013
Efficient Multi-label Classification with Many Labels ICML 2013
Fast algorithms for sparse principal component analysis based on Rayleigh quotient iteration ICML 2013
Fast Subspace Search via Grassmannian Based Hashing ICCV 2013
Dictionary Learning and Sparse Coding on Grassmann Manifolds: An Extrinsic Solution ICCV 2013
Top-Down Segmentation of Non-rigid Visual Objects Using Derivative-Based Search on Sparse Manifolds CVPR 2013
Simultaneous Rectification and Alignment via Robust Recovery of Low-rank Tensors NIPS 2013
Sign Cauchy Projections and Chi-Square Kernel NIPS 2013
Robust learning of low-dimensional dynamics from large neural ensembles NIPS 2013
Robust Low Rank Kernel Embeddings of Multivariate Distributions NIPS 2013
Multilinear Dynamical Systems for Tensor Time Series NIPS 2013
Cluster Trees on Manifolds NIPS 2013
Sparse Subspace Denoising for Image Manifolds CVPR 2013
Non-rigid Structure from Motion with Diffusion Maps Prior CVPR 2013
Learning Binary Codes for High-Dimensional Data Using Bilinear Projections CVPR 2013
Dense Non-rigid Point-Matching Using Random Projections CVPR 2013
Graph-Laplacian PCA: Closed-Form Solution and Robustness CVPR 2013
Learning a Manifold as an Atlas CVPR 2013
K-Means Hashing: An Affinity-Preserving Quantization Method for Learning Binary Compact Codes CVPR 2013
Scalable Sparse Subspace Clustering CVPR 2013
Kernel Hyperalignment NIPS 2012
Convex Multi-view Subspace Learning NIPS 2012
Super-Bit Locality-Sensitive Hashing NIPS 2012