Sciweavers

134 search results - page 14 / 27
» Random Projections for Manifold Learning
Sort
View
CVPR
2005
IEEE
14 years 12 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang

Publication
170views
13 years 9 months ago
Covariance Regularization for Supervised Learning in High Dimensions
This paper studies the effect of covariance regularization for classific ation of high-dimensional data. This is done by fitting a mixture of Gaussians with a regularized covaria...
Daniel L. Elliott, Charles W. Anderson, Michael Ki...
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 10 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
NIPS
2007
13 years 11 months ago
A Randomized Algorithm for Large Scale Support Vector Learning
This paper investigates the application of randomized algorithms for large scale SVM learning. The key contribution of the paper is to show that, by using ideas random projections...
Krishnan Kumar, Chiru Bhattacharyya, Ramesh Hariha...
PKDD
2009
Springer
153views Data Mining» more  PKDD 2009»
14 years 4 months ago
Subspace Regularization: A New Semi-supervised Learning Method
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
Yan-Ming Zhang, Xinwen Hou, Shiming Xiang, Cheng-L...