Sciweavers

10 search results - page 2 / 2
» Max-margin Multiple-Instance Learning via Semidefinite Progr...
Sort
View
ICML
2002
IEEE
14 years 6 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 6 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
JMLR
2008
169views more  JMLR 2008»
13 years 5 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
PAKDD
2004
ACM
96views Data Mining» more  PAKDD 2004»
13 years 11 months ago
Spectral Energy Minimization for Semi-supervised Learning
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
Chun Hung Li, Zhi-Li Wu
MMS
2006
13 years 5 months ago
Collaborative image retrieval via regularized metric learning
In content-based image retrieval (CBIR), relevant images are identified based on their similarities to query images. Most CBIR algorithms are hindered by the semantic gap between ...
Luo Si, Rong Jin, Steven C. H. Hoi, Michael R. Lyu