Reducing large diagonals in kernel matrices through semidefinite programming.
Hsiao-Mei LuSumeet GuptaYang DaiPublished in: BIOKDD (2003)
Keyphrases
- semidefinite programming
- kernel matrices
- kernel matrix
- positive semidefinite
- kernel methods
- kernel function
- low rank
- interior point methods
- kernel learning
- semidefinite
- feature space
- model selection
- input space
- metric learning
- linear programming
- training samples
- reproducing kernel hilbert space
- learning problems
- data sets
- missing data
- linear combination
- primal dual
- convex optimization
- ls svm
- support vector
- machine learning