基于多目标粒子群算法的最优支持向量机特征选择

I. Behravan, S. Zahiri, Oveis Dehghantanha
{"title":"基于多目标粒子群算法的最优支持向量机特征选择","authors":"I. Behravan, S. Zahiri, Oveis Dehghantanha","doi":"10.1155/2016/6305043","DOIUrl":null,"url":null,"abstract":"Support vector machine is a classifier, based on the structured risk minimization principle. The performance of the SVM, depends on different parameters such as: penalty factor, C, and the kernel factor, o. Also choosing an appropriate kernel function can improve the Recognition Score and lower the amount of computation. Furthermore, selecting the useful features among several features in dataset not only increases the performance of the SVM, but also reduces the computation time and complexity. So this is an optimization problem which can be solved by a heuristic algorithm. In some cases besides the Recognition Score, the Reliability of the classifier's output, is important. So in such cases a multi-objective optimization algorithm is needed. In this paper we have got the MOPSO algorithm to optimize the parameters of the SVM, choose appropriate kernel function and select the best features simultaneously in order to optimize the Recognition Score and the Reliability of the SVM. Nine different datasets, from UCI machine learning repository, are used to evaluate the power and the effectiveness of the proposed method (MOPSO-SVM). The results of the proposed method are compared to those which are achieved by RBF and MLP neural networks.","PeriodicalId":268101,"journal":{"name":"2016 1st Conference on Swarm Intelligence and Evolutionary Computation (CSIEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"An optimal SVM with feature selection using multi-objective PSO\",\"authors\":\"I. Behravan, S. Zahiri, Oveis Dehghantanha\",\"doi\":\"10.1155/2016/6305043\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Support vector machine is a classifier, based on the structured risk minimization principle. The performance of the SVM, depends on different parameters such as: penalty factor, C, and the kernel factor, o. Also choosing an appropriate kernel function can improve the Recognition Score and lower the amount of computation. Furthermore, selecting the useful features among several features in dataset not only increases the performance of the SVM, but also reduces the computation time and complexity. So this is an optimization problem which can be solved by a heuristic algorithm. In some cases besides the Recognition Score, the Reliability of the classifier's output, is important. So in such cases a multi-objective optimization algorithm is needed. In this paper we have got the MOPSO algorithm to optimize the parameters of the SVM, choose appropriate kernel function and select the best features simultaneously in order to optimize the Recognition Score and the Reliability of the SVM. Nine different datasets, from UCI machine learning repository, are used to evaluate the power and the effectiveness of the proposed method (MOPSO-SVM). The results of the proposed method are compared to those which are achieved by RBF and MLP neural networks.\",\"PeriodicalId\":268101,\"journal\":{\"name\":\"2016 1st Conference on Swarm Intelligence and Evolutionary Computation (CSIEC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-03-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 1st Conference on Swarm Intelligence and Evolutionary Computation (CSIEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1155/2016/6305043\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 1st Conference on Swarm Intelligence and Evolutionary Computation (CSIEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2016/6305043","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

支持向量机是一种基于结构化风险最小化原则的分类器。支持向量机的性能取决于不同的参数,如:惩罚因子C和核因子o,选择合适的核函数可以提高识别分数,降低计算量。此外,从数据集中的多个特征中选择有用的特征不仅可以提高支持向量机的性能,还可以减少计算时间和复杂度。这是一个可以用启发式算法求解的优化问题。在某些情况下,除了识别分数之外,分类器输出的可靠性也很重要。在这种情况下,需要多目标优化算法。本文采用MOPSO算法对支持向量机的参数进行优化,同时选择合适的核函数和最佳特征,以优化支持向量机的识别分数和可靠性。使用来自UCI机器学习存储库的9个不同的数据集来评估所提出的方法(MOPSO-SVM)的功率和有效性。将该方法与RBF和MLP神经网络的结果进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An optimal SVM with feature selection using multi-objective PSO
Support vector machine is a classifier, based on the structured risk minimization principle. The performance of the SVM, depends on different parameters such as: penalty factor, C, and the kernel factor, o. Also choosing an appropriate kernel function can improve the Recognition Score and lower the amount of computation. Furthermore, selecting the useful features among several features in dataset not only increases the performance of the SVM, but also reduces the computation time and complexity. So this is an optimization problem which can be solved by a heuristic algorithm. In some cases besides the Recognition Score, the Reliability of the classifier's output, is important. So in such cases a multi-objective optimization algorithm is needed. In this paper we have got the MOPSO algorithm to optimize the parameters of the SVM, choose appropriate kernel function and select the best features simultaneously in order to optimize the Recognition Score and the Reliability of the SVM. Nine different datasets, from UCI machine learning repository, are used to evaluate the power and the effectiveness of the proposed method (MOPSO-SVM). The results of the proposed method are compared to those which are achieved by RBF and MLP neural networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信