3256 search results - page 430 / 652 » Learning Linear Transformations |
187
click to vote
ICMLA
2004
15 years 7 months ago
2004
Landmarking is a recent and promising metalearning strategy, which defines meta-features that are themselves efficient learning algorithms. However, the choice of landmarkers is m...
197
click to vote
NIPS
2004
15 years 7 months ago
2004
Capturing dependencies in images in an unsupervised manner is important for many image processing applications. We propose a new method for capturing nonlinear dependencies in ima...
136
click to vote
NIPS
1998
15 years 7 months ago
1998
The W-S (Wake-Sleep) algorithm is a simple learning rule for the models with hidden variables. It is shown that this algorithm can be applied to a factor analysis model which is a...
166
click to vote
NIPS
1994
15 years 7 months ago
1994
This paper discusses the linearly weighted combination of estimators in which the weighting functions are dependent on the input. We show that the weighting functions can be deriv...
206
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...