Sciweavers

73 search results - page 5 / 15
» Sparse Unsupervised Dimensionality Reduction Algorithms
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
ICIP
2010
IEEE
13 years 5 months ago
Metaface learning for sparse representation based face recognition
Face recognition (FR) is an active yet challenging topic in computer vision applications. As a powerful tool to represent high dimensional data, recently sparse representation bas...
Meng Yang, Lei Zhang, Jian Yang, David Zhang
NIPS
2008
13 years 9 months ago
DiscLDA: Discriminative Learning for Dimensionality Reduction and Classification
Probabilistic topic models have become popular as methods for dimensionality reduction in collections of text documents or images. These models are usually treated as generative m...
Simon Lacoste-Julien, Fei Sha, Michael I. Jordan
PAMI
2007
154views more  PAMI 2007»
13 years 7 months ago
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
IJON
2010
121views more  IJON 2010»
13 years 4 months ago
Sample-dependent graph construction with application to dimensionality reduction
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
Bo Yang, Songcan Chen