3256 search results - page 426 / 652 » Learning Linear Transformations |
225
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
170
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
182
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applicatio...
284
click to vote
VLDB
2006
ACM
16 years 6 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
141
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...