重新设计具有特征选择的双目标支持向量机的 NSGA-II 元求真法

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2024-08-24 DOI:10.1016/j.cor.2024.106821
{"title":"重新设计具有特征选择的双目标支持向量机的 NSGA-II 元求真法","authors":"","doi":"10.1016/j.cor.2024.106821","DOIUrl":null,"url":null,"abstract":"<div><p>The Support Vector Machine is a well-known technique used in supervised classification. Feature selection offers several benefits but also adds complexity to the problem. In this paper, we consider the soft margin SVM and given that two different objectives are considered simultaneously, obtaining the Pareto front , or at least a good approximation of it, gives the decision-maker a wide variety of solutions and has several advantages over having only one solution. The only metaheuristic that has been developed to give an approximation of such a front is a NSGA-II based technique. However, the design of such technique presents some limitations that are analyzed in this paper. We present a new metaheuristic that has been completely redesigned in order to overcome those drawbacks. We compare both techniques through an extensive computational experiment that demonstrates the superior efficiency of the new technique.</p></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":null,"pages":null},"PeriodicalIF":4.1000,"publicationDate":"2024-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0305054824002934/pdfft?md5=582b0a9231b2a4cd2ebb8cba22b073a3&pid=1-s2.0-S0305054824002934-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Redesigning a NSGA-II metaheuristic for the bi-objective Support Vector Machine with feature selection\",\"authors\":\"\",\"doi\":\"10.1016/j.cor.2024.106821\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The Support Vector Machine is a well-known technique used in supervised classification. Feature selection offers several benefits but also adds complexity to the problem. In this paper, we consider the soft margin SVM and given that two different objectives are considered simultaneously, obtaining the Pareto front , or at least a good approximation of it, gives the decision-maker a wide variety of solutions and has several advantages over having only one solution. The only metaheuristic that has been developed to give an approximation of such a front is a NSGA-II based technique. However, the design of such technique presents some limitations that are analyzed in this paper. We present a new metaheuristic that has been completely redesigned in order to overcome those drawbacks. We compare both techniques through an extensive computational experiment that demonstrates the superior efficiency of the new technique.</p></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0305054824002934/pdfft?md5=582b0a9231b2a4cd2ebb8cba22b073a3&pid=1-s2.0-S0305054824002934-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054824002934\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824002934","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

支持向量机是一种用于监督分类的著名技术。特征选择具有多种优势,但也增加了问题的复杂性。在本文中,我们考虑的是软边际 SVM,考虑到要同时考虑两个不同的目标,获得帕累托前沿(或至少是其良好的近似值)可为决策者提供多种解决方案,与只有一个解决方案相比,它具有多种优势。目前唯一能给出帕累托前沿近似值的元启发式是一种基于 NSGA-II 的技术。然而,这种技术的设计存在一些局限性,本文将对这些局限性进行分析。为了克服这些缺点,我们提出了一种全新设计的元启发式。我们通过大量的计算实验对这两种技术进行了比较,结果表明新技术具有更高的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Redesigning a NSGA-II metaheuristic for the bi-objective Support Vector Machine with feature selection

The Support Vector Machine is a well-known technique used in supervised classification. Feature selection offers several benefits but also adds complexity to the problem. In this paper, we consider the soft margin SVM and given that two different objectives are considered simultaneously, obtaining the Pareto front , or at least a good approximation of it, gives the decision-maker a wide variety of solutions and has several advantages over having only one solution. The only metaheuristic that has been developed to give an approximation of such a front is a NSGA-II based technique. However, the design of such technique presents some limitations that are analyzed in this paper. We present a new metaheuristic that has been completely redesigned in order to overcome those drawbacks. We compare both techniques through an extensive computational experiment that demonstrates the superior efficiency of the new technique.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
A new composite heuristic to minimize the total tardiness for the single machine scheduling problem with variable and flexible maintenance An effective two-stage heuristic for scheduling the distributed assembly flowshops with sequence dependent setup times Classification and comparison of integer programming formulations for the single-machine sequencing problem A multi-criteria districting approach with a lexicographic compactness metric: An application to the Chilean postal service Service Selection under Uncertainty
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1