Learning the Kernel Matrix with Semi-Definite Programming

Learning the Kernel Matrix with Semi-Definite Programming (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Gert R. G. Lanckriet , Nello Cristianini , Laurent El Ghaoui , Peter Bartlett , Michael I. Jordan

Citations:

366 - 16 self

BibTeX

@MISC{Lanckriet02learningthe,
    author = {Gert R. G. Lanckriet and Nello Cristianini and Laurent El Ghaoui and Peter Bartlett and Michael I. Jordan},
    title = {Learning the Kernel Matrix with Semi-Definite Programming },
    year = {2002}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

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 performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space---classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semi-definite programming (SDP) techniques. When applied

Citations

2699	MJ: Introduction to Modern Information Retrieval - Salton, McGill - 1986
1512	Smola A: Learning with Kernels - Schölkopf - 2002
1094	Identification of common molecular subsequences - Smith, Waterman - 1981
741	Shawe-Taylor J (2000) An Introduction to Support Vector Machines and other kernel-based learning methods - Cristianini
581	S: Semidefinite programming - Vandenberghe, Boyd - 1996
519	Kernel Methods for Pattern Analysis - Shawe-Taylor, Cristianini - 2004
497	Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones’, Optimization Methods and Software - Sturm - 1999
319	On the method of bounded differences - McDiarmid - 1989
232	Arcing classifiers - Breiman - 1998
208	Interior point polynomial methods in convex programming - Nesterov, Nemirovski - 1994
185	Rademacher and gaussian complexities: Risk bounds and structural - Bartlett, Mendelson - 2002
180	On kernel-target alignment - Cristianini, Shawe-taylor, et al. - 2001
156	The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network - Bartlett
134	Diffusion kernels on graphs and other discrete input spaces - Kondor, Lafferty - 2002
129	Determinant maximization with linear matrix inequality constraints - Vandenberghe, Boyd, et al. - 1998
90	Empirical margin distributions and bounding the generalization error of combined classifiers - Koltchinskii, Panchenko - 2002
64	WS: Kernelbased data fusion and its application to protein function prediction in yeast. Pac Symp Biocomput 2004 - GR, Deng, et al.
45	The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm - Andersen, Andersen - 1999
45	E.J.: Duality and geometry in svm classifiers. In - Bennett, Bredensteiner - 2000
39	Sun F: An integrated probabilistic model for functional prediction of proteins - Deng, Chen
31	Text Categorization by Boosting Automatically Extracted Concepts - Cai, Hofmann - 2003
29	Using sparseness and analytic QP to speed training of support vector machines - Platt - 1999
23	PAC-Bayesian generalization error bounds for gaussian process classification. Informatics report series EDI-INF-RR-0094 - Seeger - 2002
10	Support vector classification with asymmetric kernel function - Tsuda - 2004
9	Sparse Bayesian classifiers for text categorization - Eyheramendy, Genkin, et al. - 2003
7	Convex optimization. Course notes for EE364 - Boyd, Vandenberghe - 2001
4	Convex tuning of the soft margin parameter - Bie, Lanckriet, et al. - 2003
4	Support vector machines for text categorization based on latent semantic indexing - Huang - 2003
2	Convex optimization of the 2-norm soft margin parameter in support vector machines - Bie, Lanckriet, et al. - 2002
2	Soft margin and margin distribution - Shawe-Taylor, Cristianini - 1999
1	70 the Kernel Matrix with Semidefinite Programming Cristianini - N, Shawe-Taylor - 2000
1	Kernel Methods for Pattern Analysis - Lanckriet, Bartlett, et al. - 2004