Reducing Kernel Matrix Diagonal Dominance Using Semi-definite Programming

By Jaz S. Kandola, Thore Graepel, John Shawe-Taylor. 2003

15 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Mechanics, Computer Vision and Pattern Recognition

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Zhen Zhang
2. Arye Nehorai
3. Mianzhi Wang
4. Yijian Xiang
5. Yan Huang

In Computational Mechanics

1. Arye Nehorai

In Computer Vision and Pattern Recognition

1. Zhen Zhang
2. Arye Nehorai
3. Mianzhi Wang
4. Yijian Xiang
5. Yan Huang

Citations in the corpus

• RetGK: Graph Kernels based on Return Probabilities of Random Walks (2018, background): “As pointed out in [32], increasing the size of substructures will largely decrease the probability that two graphs contain similar substructures, which usually results in the "diagonal dominance issue" [14].”