在高度不平衡的数据集中使用boosting提高少数类的分类性能

M. Abouelenien, Xiaohui Yuan, P. Duraisamy, Xiaojing Yuan
{"title":"在高度不平衡的数据集中使用boosting提高少数类的分类性能","authors":"M. Abouelenien, Xiaohui Yuan, P. Duraisamy, Xiaojing Yuan","doi":"10.1109/ICCCNT.2012.6477850","DOIUrl":null,"url":null,"abstract":"Data imbalance is a common property in many medical and biological data and usually results in degraded generalization performance. In this article, we present a novel boosting method to address two important questions in learning from imbalanced dataset: how to maximize the performance of classifying the minority instances without compromising the performance for the majority instances? and how to select training instances to achieve a comprehensive representation of the data distribution and avoid high computational time? Our method maximizes the usage of the available samples with priority given to the minority samples. The base classifiers are weighted with their sensitivities derived from the training examples. Using synthetic and real-world datasets, we demonstrated the performance improvement of our method in both sensitivity and accuracy without major reduction in specificity. In contrast to AdaBoost, our method took much less time, which makes it applicable in real-world problems that have large amount of data.","PeriodicalId":364589,"journal":{"name":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improving classification performance for the minority class in highly imbalanced dataset using boosting\",\"authors\":\"M. Abouelenien, Xiaohui Yuan, P. Duraisamy, Xiaojing Yuan\",\"doi\":\"10.1109/ICCCNT.2012.6477850\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data imbalance is a common property in many medical and biological data and usually results in degraded generalization performance. In this article, we present a novel boosting method to address two important questions in learning from imbalanced dataset: how to maximize the performance of classifying the minority instances without compromising the performance for the majority instances? and how to select training instances to achieve a comprehensive representation of the data distribution and avoid high computational time? Our method maximizes the usage of the available samples with priority given to the minority samples. The base classifiers are weighted with their sensitivities derived from the training examples. Using synthetic and real-world datasets, we demonstrated the performance improvement of our method in both sensitivity and accuracy without major reduction in specificity. In contrast to AdaBoost, our method took much less time, which makes it applicable in real-world problems that have large amount of data.\",\"PeriodicalId\":364589,\"journal\":{\"name\":\"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCNT.2012.6477850\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCNT.2012.6477850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

数据不平衡是许多医学和生物数据的共同特性,通常会导致泛化性能下降。在本文中,我们提出了一种新的增强方法来解决从不平衡数据集中学习的两个重要问题:如何在不影响大多数实例的性能的情况下最大化少数实例的分类性能?如何选择训练实例,既能全面表征数据分布,又能避免大量的计算时间?我们的方法最大限度地利用可用样本,优先考虑少数样本。基分类器根据训练样本的灵敏度进行加权。使用合成和真实世界的数据集,我们证明了我们的方法在灵敏度和准确性方面的性能改进,而特异性没有明显降低。与AdaBoost相比,我们的方法花费的时间要少得多,这使得它适用于具有大量数据的现实问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving classification performance for the minority class in highly imbalanced dataset using boosting
Data imbalance is a common property in many medical and biological data and usually results in degraded generalization performance. In this article, we present a novel boosting method to address two important questions in learning from imbalanced dataset: how to maximize the performance of classifying the minority instances without compromising the performance for the majority instances? and how to select training instances to achieve a comprehensive representation of the data distribution and avoid high computational time? Our method maximizes the usage of the available samples with priority given to the minority samples. The base classifiers are weighted with their sensitivities derived from the training examples. Using synthetic and real-world datasets, we demonstrated the performance improvement of our method in both sensitivity and accuracy without major reduction in specificity. In contrast to AdaBoost, our method took much less time, which makes it applicable in real-world problems that have large amount of data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信