← Core Methods
Machine Learning › Core Methods ›

Dimensionality Reduction

706 directly classified papers

Papers per year

Papers

Regularized Laplacian Estimation and Fast Eigenvector Approximation NIPS 2011
The Stationary Subspace Analysis Toolbox JMLR 2011
Multilinear Subspace Regression: An Orthogonal Tensor Decomposition Approach NIPS 2011
Dimensionality Reduction Using the Sparse Linear Model NIPS 2011
A Denoising View of Matrix Completion NIPS 2011
Humans Learn Using Manifolds, Reluctantly NIPS 2010
Fast detection of multiple change-points shared by many signals using group LARS NIPS 2010
Robust PCA via Outlier Pursuit NIPS 2010
Inference of Sparse Networks with Unobserved Variables. Application to Gene Regulatory Networks AISTATS 2010
Fluid Dynamics Models for Low Rank Discriminant Analysis AISTATS 2010
Random Projection Trees Revisited NIPS 2010
Random Projections for $k$-means Clustering NIPS 2010
Efficient Optimization for Discriminative Latent Class Models NIPS 2010
Sufficient Dimension Reduction via Squared-loss Mutual Information Estimation AISTATS 2010
Simple Exponential Family PCA AISTATS 2010
An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA NIPS 2010
Worst-Case Linear Discriminant Analysis NIPS 2010
Estimation of Rényi Entropy and Mutual Information Based on Generalized Nearest-Neighbor Graphs NIPS 2010
Penalized Principal Component Regression on Graphs for Analysis of Subnetworks NIPS 2010
Sample Complexity of Testing the Manifold Hypothesis NIPS 2010
LSTD with Random Projections NIPS 2010
Unsupervised Kernel Dimension Reduction NIPS 2010
CUR from a Sparse Optimization Viewpoint NIPS 2010
Locality-sensitive binary codes from shift-invariant kernels NIPS 2009
Multi-Label Prediction via Sparse Infinite CCA NIPS 2009