基于多目标进化算法的最近邻分类原型选择比较

G. Acampora, G. Tortora, A. Vitiello
{"title":"基于多目标进化算法的最近邻分类原型选择比较","authors":"G. Acampora, G. Tortora, A. Vitiello","doi":"10.1109/SSCI.2016.7849936","DOIUrl":null,"url":null,"abstract":"The nearest neighbor classifiers are popular supervised classifiers due to their ease of use and good performance. However, in spite of their success, they suffer from some defects such as high storage requirements, high computational complexity, and low noise tolerance. In order to address these drawbacks, prototype selection has been studied as a technique to reduce the size of training datasets without deprecating the classification accuracy. Due to the need of achieving a trade-off between accuracy and reduction, Multi-Objective Evolutionary Algorithms (MOEAs) are emerging as methods efficient in solving the prototype selection problem. The goal of this paper is to perform a systematic comparison among well-known MOEAs in order to study their effects in solving this problem. The comparison involves the study of MOEAs' performance in terms of the well-known measures such as hypervolume, Δ index and coverage of two sets. The empirical analysis of the experimental results is validated through a statistical multiple comparison procedure.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Comparison of Multi-objective Evolutionary Algorithms for prototype selection in nearest neighbor classification\",\"authors\":\"G. Acampora, G. Tortora, A. Vitiello\",\"doi\":\"10.1109/SSCI.2016.7849936\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The nearest neighbor classifiers are popular supervised classifiers due to their ease of use and good performance. However, in spite of their success, they suffer from some defects such as high storage requirements, high computational complexity, and low noise tolerance. In order to address these drawbacks, prototype selection has been studied as a technique to reduce the size of training datasets without deprecating the classification accuracy. Due to the need of achieving a trade-off between accuracy and reduction, Multi-Objective Evolutionary Algorithms (MOEAs) are emerging as methods efficient in solving the prototype selection problem. The goal of this paper is to perform a systematic comparison among well-known MOEAs in order to study their effects in solving this problem. The comparison involves the study of MOEAs' performance in terms of the well-known measures such as hypervolume, Δ index and coverage of two sets. The empirical analysis of the experimental results is validated through a statistical multiple comparison procedure.\",\"PeriodicalId\":120288,\"journal\":{\"name\":\"2016 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Symposium Series on Computational Intelligence (SSCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SSCI.2016.7849936\",\"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 IEEE Symposium Series on Computational Intelligence (SSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSCI.2016.7849936","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

最近邻分类器由于其易于使用和良好的性能而成为流行的监督分类器。然而,尽管它们取得了成功,但也存在存储要求高、计算复杂度高、噪声容忍度低等缺陷。为了解决这些缺点,原型选择被研究作为一种技术来减少训练数据集的大小而不影响分类精度。由于需要在精度和约简之间取得平衡,多目标进化算法(moea)成为解决原型选择问题的有效方法。本文的目的是对知名的moea进行系统比较,以研究它们在解决这一问题方面的效果。比较涉及使用hypervolume、Δ指数和两组覆盖率等众所周知的度量来研究moea的性能。通过统计多元比较对实验结果进行了实证分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Comparison of Multi-objective Evolutionary Algorithms for prototype selection in nearest neighbor classification
The nearest neighbor classifiers are popular supervised classifiers due to their ease of use and good performance. However, in spite of their success, they suffer from some defects such as high storage requirements, high computational complexity, and low noise tolerance. In order to address these drawbacks, prototype selection has been studied as a technique to reduce the size of training datasets without deprecating the classification accuracy. Due to the need of achieving a trade-off between accuracy and reduction, Multi-Objective Evolutionary Algorithms (MOEAs) are emerging as methods efficient in solving the prototype selection problem. The goal of this paper is to perform a systematic comparison among well-known MOEAs in order to study their effects in solving this problem. The comparison involves the study of MOEAs' performance in terms of the well-known measures such as hypervolume, Δ index and coverage of two sets. The empirical analysis of the experimental results is validated through a statistical multiple comparison procedure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evolutionary dynamic optimisation of airport security lane schedules Variable Neighbourhood Search: A case study for a highly-constrained workforce scheduling problem Local modes-based free-shape data partitioning A dynamic truck dispatching problem in marine container terminal Spaceplane trajectory optimisation with evolutionary-based initialisation
×
引用
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