Nearest neighbors and density-based undersampling for imbalanced data classification with class overlap

IF 5.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
{"title":"Nearest neighbors and density-based undersampling for imbalanced data classification with class overlap","authors":"","doi":"10.1016/j.neucom.2024.128492","DOIUrl":null,"url":null,"abstract":"<div><p>While addressing the problem of imbalanced data classification, most existing resampling methods primarily focus on balancing class distribution. However, they often overlook class overlap and fail to adequately consider the feature distributions of different classes. Consequently, when resampling is performed under such conditions, samples within areas of overlap remain susceptible to misclassification, failing to substantially improve overall performance. To address these shortcomings, we propose a novel data resampling technique, Nearest Neighbors and Density-based Undersampling (NDU). This method employs within-class k-nearest neighbors and between-class probability densities to design a weight assignment strategy. Leveraging this strategy, we establish an exclusive metric, the F_factor, to evaluate the importance of majority class samples in overlap areas. Subsequently, NDU promotes a gradient-based segmented undersampling strategy, which applies varying degrees of undersampling to majority class samples across segmented regions. Through experiments on binary imbalanced datasets with class overlap, we evaluate the efficiency of diverse resampling methods concerning classification performance. The results demonstrate that our proposed method effectively addresses class overlap challenges.</p></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":null,"pages":null},"PeriodicalIF":5.5000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231224012633","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

While addressing the problem of imbalanced data classification, most existing resampling methods primarily focus on balancing class distribution. However, they often overlook class overlap and fail to adequately consider the feature distributions of different classes. Consequently, when resampling is performed under such conditions, samples within areas of overlap remain susceptible to misclassification, failing to substantially improve overall performance. To address these shortcomings, we propose a novel data resampling technique, Nearest Neighbors and Density-based Undersampling (NDU). This method employs within-class k-nearest neighbors and between-class probability densities to design a weight assignment strategy. Leveraging this strategy, we establish an exclusive metric, the F_factor, to evaluate the importance of majority class samples in overlap areas. Subsequently, NDU promotes a gradient-based segmented undersampling strategy, which applies varying degrees of undersampling to majority class samples across segmented regions. Through experiments on binary imbalanced datasets with class overlap, we evaluate the efficiency of diverse resampling methods concerning classification performance. The results demonstrate that our proposed method effectively addresses class overlap challenges.

基于近邻和密度的欠采样,用于有类别重叠的不平衡数据分类
在解决不平衡数据分类问题时,大多数现有的重采样方法主要侧重于平衡类的分布。然而,这些方法往往忽略了类的重叠,未能充分考虑不同类的特征分布。因此,在这种情况下进行重采样时,重叠区域内的样本仍然容易被错误分类,无法大幅提高整体性能。为了解决这些缺陷,我们提出了一种新颖的数据重采样技术--近邻和基于密度的下采样(NDU)。这种方法利用类内 k 近邻和类间概率密度来设计权重分配策略。利用这一策略,我们建立了一个专属指标--F_因子,用于评估重叠区域中多数类样本的重要性。随后,NDU 推广了一种基于梯度的分段欠采样策略,该策略在分段区域内对多数类样本进行不同程度的欠采样。通过在具有类重叠的二元不平衡数据集上进行实验,我们评估了不同重采样方法在分类性能方面的效率。结果表明,我们提出的方法能有效解决类重叠难题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
×
引用
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学术官方微信