基于支持向量机的欠采样算法

Zheng Hengyu
{"title":"基于支持向量机的欠采样算法","authors":"Zheng Hengyu","doi":"10.1109/AIID51893.2021.9456573","DOIUrl":null,"url":null,"abstract":"Tradition classification algorithms often get poor performance in imbalanced datasets because they are proposed under the assumption that the datasets are nearly balanced. Random under-sampling(RUS) algorithm is a popular algorithm to solve imbalance problem through removing some majority class samples randomly. However, RUS algorithm may neglect some key information of datasets. A new under-sampling algorithm based on SVM is proposed in this paper. The proposed algorithm aims to reserve samples distribution information in undersampling process. The simulation results show that the proposed algorithm could achieve satisfying performance.","PeriodicalId":412698,"journal":{"name":"2021 IEEE International Conference on Artificial Intelligence and Industrial Design (AIID)","volume":"210 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Under-Sampling Algorithm Based on SVM\",\"authors\":\"Zheng Hengyu\",\"doi\":\"10.1109/AIID51893.2021.9456573\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Tradition classification algorithms often get poor performance in imbalanced datasets because they are proposed under the assumption that the datasets are nearly balanced. Random under-sampling(RUS) algorithm is a popular algorithm to solve imbalance problem through removing some majority class samples randomly. However, RUS algorithm may neglect some key information of datasets. A new under-sampling algorithm based on SVM is proposed in this paper. The proposed algorithm aims to reserve samples distribution information in undersampling process. The simulation results show that the proposed algorithm could achieve satisfying performance.\",\"PeriodicalId\":412698,\"journal\":{\"name\":\"2021 IEEE International Conference on Artificial Intelligence and Industrial Design (AIID)\",\"volume\":\"210 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Artificial Intelligence and Industrial Design (AIID)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AIID51893.2021.9456573\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Artificial Intelligence and Industrial Design (AIID)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIID51893.2021.9456573","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

传统的分类算法是在数据集接近平衡的假设下提出的,在不平衡的数据集上往往表现不佳。随机欠采样(RUS)算法是一种通过随机去除多数类样本来解决不平衡问题的常用算法。然而,RUS算法可能会忽略数据集的一些关键信息。提出了一种基于支持向量机的欠采样算法。该算法旨在保留欠采样过程中的样本分布信息。仿真结果表明,该算法能够达到满意的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Under-Sampling Algorithm Based on SVM
Tradition classification algorithms often get poor performance in imbalanced datasets because they are proposed under the assumption that the datasets are nearly balanced. Random under-sampling(RUS) algorithm is a popular algorithm to solve imbalance problem through removing some majority class samples randomly. However, RUS algorithm may neglect some key information of datasets. A new under-sampling algorithm based on SVM is proposed in this paper. The proposed algorithm aims to reserve samples distribution information in undersampling process. The simulation results show that the proposed algorithm could achieve satisfying performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信