首页> 外文会议>IEEE Symposium Series on Computational Intelligence >Kernel Target Alignment based Fuzzy Least Square Twin Bounded Support Vector Machine
【24h】

Kernel Target Alignment based Fuzzy Least Square Twin Bounded Support Vector Machine

机译:基于核目标对准的模糊最小二乘有界支持向量机

获取原文

摘要

A kernel-target alignment based fuzzy least square twin bounded support vector machine (KTA-FLSTBSVM) is proposed to reduce the effects of outliers and noise. The proposed model is an effective and efficient fuzzy based least square twin bounded support vector machine for binary classification where the membership values are assigned based on kernel-target alignment approach. The proposed KTA-FLSTBSVM solves the two systems of linear equations, which is computationally very fast with significant comparable performance. To development the robust model, this approach minimizes the structural risk which is the gist of statistical learning theory. This powerful KTA-FLSTBSVM approach is tested on artificial data sets as well as benchmark real-world datasets that provide significantly better result in terms of generalization performance and computational time.
机译:为了减少离群值和噪声的影响,提出了一种基于核目标对准的模糊最小二乘有界支持向量机(KTA-FLSTBSVM)。所提出的模型是一种有效且高效的基于模糊最小二乘有界支持向量机,用于二进制分类,其中基于核目标对齐方法分配成员值。所提出的KTA-FLSTBSVM解决了两个线性方程组,计算速度非常快,并且具有相当的可比性能。为了开发健壮的模型,此方法将结构风险降到最低,这是统计学习理论的要旨。这种强大的KTA-FLSTBSVM方法已在人工数据集和基准真实数据集上进行了测试,这些数据集在泛化性能和计算时间方面均提供了明显更好的结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号