63 search results - page 12 / 13 » Learning low-rank kernel matrices |
ICDM
2010
IEEE
13 years 4 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
ICML
2008
IEEE
14 years 7 months ago
2008
IEEE
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
ICIAP
2003
ACM
14 years 7 months ago
2003
ACM
In this paper we present a statistical learning scheme for image classification based on a mixture of old fashioned ideas and state of the art learning tools. We represent input i...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper, we take the human age and pose estimation problems as examples to study automatic designing regressor from training samples with uncertain nonnegative labels. First...
AAAI
2008
13 years 9 months ago
2008
Most manifold learning methods consider only one similarity matrix to induce a low-dimensional manifold embedded in data space. In practice, however, we often use multiple sensors...