Learning Nonparametric Kernel Matrices from Pairwise Constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Some kernel learning methods assume the target kernel matrix to be a linear combination of parametric kernel matrices. This...
Saved in:
Main Authors: | HOI, Steven C. H., JIN, Rong, LYU, Michael R. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2007
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2384 https://ink.library.smu.edu.sg/context/sis_research/article/3384/viewcontent/537.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A Family of Simple Non-Parametric Kernel Learning Algorithms from Pairwise Constraints
by: ZHUANG, Jinfeng, et al.
Published: (2011) -
A Multi-Scale Tikhonov Regularization Scheme for Implicit Surface Modeling
by: ZHU, Jianke, et al.
Published: (2007) -
Probability density function estimation using gamma kernels
by: Chen, S.X.
Published: (2014) -
Nonparametric estimate of spectral density functions of sample covariance matrices: A first step
by: Jing, B.-Y., et al.
Published: (2014) -
Robust regularized Kernel regression
by: ZHU, Jianke, et al.
Published: (2008)