Dealing with large diagonals in kernel matrices

DOI10.1007/BF02530507MaRDI QIDQ1881406zbMATH OpenOpenAlexFDO

Authors Jason Weston, Bernhard Schölkopf, Eleazar Eskin, C. Leslie, William Noble

Publication date 5 October 2004

Published in Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1934580
• scientific article; zbMATH DE number 1931862
• Reducing kernel matrix diagonal dominance using semi-definite programming.
• Learning Theory
• 10.1162/15324430260185619

Cites work

• scientific article; zbMATH DE number 4004880 (Why is no real title available?)
• scientific article; zbMATH DE number 47282 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 1934580 (Why is no real title available?)
• scientific article; zbMATH DE number 1950576 (Why is no real title available?)
• 10.1162/153244302760200687
• A New Discriminative Kernel from Probabilistic Models
• Gene selection for cancer classification using support vector machines

Cited in

(5)

• Versatile string kernels
• A review on distance based time series classification
• Reducing kernel matrix diagonal dominance using semi-definite programming.
• scientific article; zbMATH DE number 1934580 (Why is no real title available?)
• Fast learning of relational kernels

This page was built for publication: Dealing with large diagonals in kernel matrices

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