An improvement to gravitational fixed radius nearest neighbor for imbalanced problem

Mahin Shabani-kordshooli, Bahareh Nikpour, H. Nezamabadi-pour
{"title":"An improvement to gravitational fixed radius nearest neighbor for imbalanced problem","authors":"Mahin Shabani-kordshooli, Bahareh Nikpour, H. Nezamabadi-pour","doi":"10.1109/AISP.2017.8324109","DOIUrl":null,"url":null,"abstract":"Mining of imbalanced data is one of the basic challenges in the field of machine learning and data mining. In the recent years, a lot of approaches have been proposed to handle imbalanced learning problem. A group of these methods are algorithmic level methods, which are adapted to the nature of imbalanced datasets. Gravitational fixed radius nearest neighbor algorithm (GFRNN) is an algorithmic level method, proposed in order to improve k nearest neighbor classifier when dealing with imbalanced datasets. This algorithm finds the fixed radius nearest neighbors as candidate set. Then, by computing the sum of gravitational forces on a query instance from candidate set, predict its label. Simplicity and no need for manually parameter setting during the run of algorithm are the main advantages of this method. In this paper, gravitational search algorithm (GSA) is used with the aim of finding the mass of training instances to improve the performance of GFRNN. Also we utilize the all training instances to make a decision about query instance. Experimental result on fifteen datasets show the superiority of it compared with four other algorithms.","PeriodicalId":386952,"journal":{"name":"2017 Artificial Intelligence and Signal Processing Conference (AISP)","volume":"52 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Artificial Intelligence and Signal Processing Conference (AISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AISP.2017.8324109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Mining of imbalanced data is one of the basic challenges in the field of machine learning and data mining. In the recent years, a lot of approaches have been proposed to handle imbalanced learning problem. A group of these methods are algorithmic level methods, which are adapted to the nature of imbalanced datasets. Gravitational fixed radius nearest neighbor algorithm (GFRNN) is an algorithmic level method, proposed in order to improve k nearest neighbor classifier when dealing with imbalanced datasets. This algorithm finds the fixed radius nearest neighbors as candidate set. Then, by computing the sum of gravitational forces on a query instance from candidate set, predict its label. Simplicity and no need for manually parameter setting during the run of algorithm are the main advantages of this method. In this paper, gravitational search algorithm (GSA) is used with the aim of finding the mass of training instances to improve the performance of GFRNN. Also we utilize the all training instances to make a decision about query instance. Experimental result on fifteen datasets show the superiority of it compared with four other algorithms.
不平衡问题引力固定半径最近邻的改进
不平衡数据的挖掘是机器学习和数据挖掘领域的基本挑战之一。近年来,人们提出了许多解决不平衡学习问题的方法。这些方法中的一组是算法级方法,它们适应于不平衡数据集的性质。重力固定半径最近邻算法(GFRNN)是为了改进k最近邻分类器在处理不平衡数据集时的性能而提出的一种算法级方法。该算法寻找半径固定的最近邻作为候选集。然后,通过计算候选集查询实例的引力和,预测其标签。该方法的主要优点是操作简单,在算法运行过程中不需要手动设置参数。本文采用重力搜索算法(GSA)来寻找训练实例的质量,以提高GFRNN的性能。并利用所有的训练实例对查询实例进行决策。在15个数据集上的实验结果表明,该算法与其他四种算法相比具有优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信