.png){kind=icon}
返回
A kernel path algorithm for general parametric quadratic programming problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2021.107941.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
It is well known that the performance of a kernel method highly depends on the choice of kernel parameter. A kernel path provides a compact representation of all optimal solutions, which can be used to choose the optimal value of kernel parameter along with cross validation (CV) method. However, none of these existing kernel path algorithms provides a unified implementation to various learning problems. To fill this gap, in this paper, we first study a general parametric quadratic programming (PQP) problem that can be instantiated to an extensive number of learning problems. Then we provide a generalized kernel path (GKP) for the general PQP problem. Furthermore, we analyze the iteration complexity and computational complexity of GKP. Extensive experimental results on various benchmark datasets not only confirm the identity of GKP with several existing kernel path algorithms, but also show that our GKP is superior to the existing kernel path algorithms in terms of generalization and robustness. (c) 2021 Elsevier Ltd. All rights reserved.
Keyword:
Kernel path
QR decomposition
Parametric quadratic programming
Cross validation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Gaussian kernel c-means hard clustering algorithms with automated computation of the width hyper-parameters.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
Non-rigid visible and infrared face registration via regularized Gaussian fields criterionPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容