1235 search results - page 62 / 247 » Learning with Idealized Kernels |
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
WAIM
2009
Springer
14 years 2 months ago
2009
Springer
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
CVPR
2010
IEEE
13 years 10 months ago
2010
IEEE
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We consider the least-square regression problem with regularization by a block 1-norm, that is, a sum of Euclidean norms over spaces of dimensions larger than one. This problem, r...