首页> 外文期刊>Turkish Journal of Electrical Engineering and Computer Sciences >A new fuzzy membership assignment and model selection approach based on dynamic class centers for fuzzy SVM family using the firefly algorithm
【24h】

A new fuzzy membership assignment and model selection approach based on dynamic class centers for fuzzy SVM family using the firefly algorithm

机译:基于萤火虫算法的基于动态类中心的模糊SVM系列模糊成员分配和模型选择新方法

获取原文
           

摘要

The support vector machine (SVM) is a powerful tool for classification problems. Unfortunately, the training phase of the SVM is highly sensitive to noises in the training set. Noises are inevitable in real-world applications. To overcome this problem, the SVM was extended to a fuzzy SVM by assigning an appropriate fuzzy membership to each data point. However, suitable choice of fuzzy memberships and an accurate model selection raise fundamental issues. In this paper, we propose a new method based on optimization methods to simultaneously generate appropriate fuzzy membership and solve the model selection problem for the SVM family in linearonlinear and separableonseparable classification problems. Both the SVM and least square SVM are included in the study. The fuzzy memberships are built based on dynamic class centers. The firefly algorithm (FA), a recently developed nature-inspired optimization algorithm, provides variation in the position of class centers by changing their attributes' values. Hence, adjusting the place of the class center can properly generate accurate fuzzy memberships to cope with both attribute and class noises. Furthermore, through the process of generating fuzzy memberships, the FA can choose the best parameters for the SVM family. A set of experiments is conducted on nine benchmarking data sets of the UCI data base. The experimental results show the effectiveness of the proposed method in comparison to the seven well-known methods of the SVM literature.
机译:支持向量机(SVM)是解决分类问题的强大工具。不幸的是,SVM的训练阶段对训练集中的噪声高度敏感。在实际应用中,噪声是不可避免的。为了克服此问题,通过为每个数据点分配适当的模糊成员资格,将SVM扩展为模糊SVM。然而,模糊成员的合适的选择和精确的模型选择提高的根本问题。本文提出了一种基于优化方法的新方法,该方法可以同时生成适当的模糊隶属度,并解决线性/非线性和可分离/不可分离分类问题中支持向量机系列的模型选择问题。 SVM和最小二乘SVM均包含在研究中。模糊成员资格是基于动态类中心构建的。萤火虫算法(FA)是最近开发的自然启发式优化算法,它通过更改类属性的属性值来提供类中心位置的变化。因此,调整班级中心的位置可以适当地生成准确的模糊成员资格,以应对属性噪声和班级噪声。此外,通过生成模糊隶属关系的过程,FA可以为SVM系列选择最佳参数。对UCI数据库的9个基准数据集进行了一组实验。实验结果表明,与SVM文献中的七个众所周知的方法相比,该方法是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号