.png){kind=icon}
返回
Ideal regularization for learning kernels from labels
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2014.04.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a new form of regularization that is able to utilize the label information of a data set for learning kernels. The proposed regularization, referred to as ideal regularization, is a linear function of the kernel matrix to be learned. The ideal regularization allows us to develop efficient algorithms to exploit labels. Three applications of the ideal regularization are considered. Firstly, we use the ideal regularization to incorporate the labels into a standard kernel, making the resulting kernel more appropriate for learning tasks. Next, we employ the ideal regularization to learn a data-dependent kernel matrix from an initial kernel matrix (which contains prior similarity information, geometric structures, and labels of the data). Finally, we incorporate the ideal regularization to some state-of-the-art kernel learning problems. With this regularization, these learning problems can be formulated as simpler ones which permit more efficient solvers. Empirical results show that the ideal regularization exploits the labels effectively and efficiently. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Kernel methods
Regularization
Labels
Ideal kernel
Semi-supervised learning
von Neumann divergence
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
8.2K
被引数:
3.0W
机构
查看更多机构
引用论文
分享收藏Solution structure of 5-keto-D-fructose: relevance to the specificity of hexose kinases.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏Nonlinear nonnegative matrix factorization based on Mercer kernel constructionPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏Learning the kernel matrix by maximizing a KFD-based class separability criterionPATTERN RECOGNITION
OAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏 没有更多内容