Sciweavers

231 search results - page 36 / 47
» Spectral domain-transfer learning
Sort
View
CVPR
2009
IEEE
15 years 3 months ago
Shared Kernel Information Embedding for Discriminative Inference
Latent Variable Models (LVM), like the Shared-GPLVM and the Spectral Latent Variable Model, help mitigate over- fitting when learning discriminative methods from small or modera...
David J. Fleet, Leonid Sigal, Roland Memisevic
ECML
2005
Springer
14 years 2 months ago
Nonrigid Embeddings for Dimensionality Reduction
Spectral methods for embedding graphs and immersing data manifolds in low-dimensional speaces are notoriously unstable due to insufficient and/or numberically ill-conditioned con...
Matthew Brand
IJCAI
2003
13 years 10 months ago
Continuous nonlinear dimensionality reduction by kernel Eigenmaps
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
Matthew Brand
PKDD
2009
Springer
120views Data Mining» more  PKDD 2009»
14 years 3 months ago
Variational Graph Embedding for Globally and Locally Consistent Feature Extraction
Existing feature extraction methods explore either global statistical or local geometric information underlying the data. In this paper, we propose a general framework to learn fea...
Shuang-Hong Yang, Hongyuan Zha, Shaohua Kevin Zhou...
JMLR
2006
124views more  JMLR 2006»
13 years 8 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini