Sciweavers

194 search results - page 8 / 39
» Subspace Regularization: A New Semi-supervised Learning Meth...
Sort
View
ECML
2007
Springer
15 years 5 months ago
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
Mark Schmidt, Glenn Fung, Rómer Rosales
84
Voted
ALT
2006
Springer
15 years 8 months ago
Unsupervised Slow Subspace-Learning from Stationary Processes
Abstract. We propose a method of unsupervised learning from stationary, vector-valued processes. A low-dimensional subspace is selected on the basis of a criterion which rewards da...
Andreas Maurer
96
Voted
ICDM
2007
IEEE
159views Data Mining» more  ICDM 2007»
15 years 3 months ago
Spectral Regression: A Unified Approach for Sparse Subspace Learning
Recently the problem of dimensionality reduction (or, subspace learning) has received a lot of interests in many fields of information processing, including data mining, informati...
Deng Cai, Xiaofei He, Jiawei Han
ECML
2007
Springer
15 years 5 months ago
Principal Component Analysis for Large Scale Problems with Lots of Missing Values
Abstract. Principal component analysis (PCA) is a well-known classical data analysis technique. There are a number of algorithms for solving the problem, some scaling better than o...
Tapani Raiko, Alexander Ilin, Juha Karhunen
CVPR
2007
IEEE
16 years 1 months ago
Learning a Spatially Smooth Subspace for Face Recognition
Subspace learning based face recognition methods have attracted considerable interests in recently years, including Principal Component Analysis (PCA), Linear Discriminant Analysi...
Deng Cai, Xiaofei He, Yuxiao Hu, Jiawei Han, Thoma...