...
首页> 外文期刊>Neural Networks and Learning Systems, IEEE Transactions on >Complex Support Vector Machines for Regression and Quaternary Classification
【24h】

Complex Support Vector Machines for Regression and Quaternary Classification

机译:用于回归和第四级分类的复杂支持向量机

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

The paper presents a new framework for complex support vector regression (SVR) as well as Support Vector Machines (SVM) for quaternary classification. The method exploits the notion of widely linear estimation to model the input-out relation for complex-valued data and considers two cases: 1) the complex data are split into their real and imaginary parts and a typical real kernel is employed to map the complex data to a complexified feature space and 2) a pure complex kernel is used to directly map the data to the induced complex feature space. The recently developed Wirtinger’s calculus on complex reproducing kernel Hilbert spaces is employed to compute the Lagrangian and derive the dual optimization problem. As one of our major results, we prove that any complex SVM/SVR task is equivalent with solving two real SVM/SVR tasks exploiting a specific real kernel, which is generated by the chosen complex kernel. In particular, the case of pure complex kernels leads to the generation of new kernels, which have not been considered before. In the classification case, the proposed framework inherently splits the complex space into four parts. This leads naturally to solving the four class-task (quaternary classification), instead of the typical two classes of the real SVM. In turn, this rationale can be used in a multiclass problem as a split-class scenario based on four classes, as opposed to the one-versus-all method; this can lead to significant computational savings. Experiments demonstrate the effectiveness of the proposed framework for regression and classification tasks that involve complex data.
机译:本文提出了一种用于复杂支持向量回归(SVR)以及用于四级分类的支持向量机(SVM)的新框架。该方法利用广义线性估计的概念对复数值数据的输入输出关系进行建模,并考虑了两种情况:1)将复数数据分为实部和虚部,并使用典型的实核来映射复数数据到复杂特征空间; 2)使用纯复杂内核直接将数据映射到诱导的复杂特征空间。最近在复杂的再现核Hilbert空间上开发的Wirtinger演算被用于计算Lagrangian并推导对偶优化问题。作为我们的主要结果之一,我们证明任何复杂的SVM / SVR任务都等同于利用特定的真实内核来解决两个真实的SVM / SVR任务,该任务由选定的复杂内核生成。特别是,纯复杂内核的情况会导致生成新内核,而以前从未考虑过。在分类的情况下,所提出的框架固有地将复杂空间分为四个部分。这自然导致解决了四个类任务(第四类),而不是实际SVM的典型两个类。反过来,这种原理可以在多类问题中用作基于四个类的拆分类方案,而不是“一对多”方法。这可以节省大量计算资源。实验证明了所提出的框架对涉及复杂数据的回归和分类任务的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号