Reducing kernel matrix diagonal dominance using semi-definite programming.

DOI10.1007/B12006MaRDI QIDQ5305858zbMATH OpenOpenAlexFDO

Authors J. S. Kandola, Thore Graepel, John Shawe-Taylor

Publication date 23 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b12006

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Semidefinite programming (90C22)

Recommendations

• scientific article; zbMATH DE number 1934580
• scientific article; zbMATH DE number 1931862
• Dealing with large diagonals in kernel matrices
• Learning the kernel matrix with semidefinite programming
• Learning Theory

Cited in

(5)

• On using prototype reduction schemes to optimize kernel-based nonlinear subspace methods.
• Dealing with large diagonals in kernel matrices
• Computation of the regression kernel matrix using semidefinite programming
• scientific article; zbMATH DE number 1934580 (Why is no real title available?)
• Learning an efficient constructive sampler for graphs

This page was built for publication: Reducing kernel matrix diagonal dominance using semi-definite programming.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305858)