Feature and instances selection for nearest neighbor classification via cooperative PSO

S. Ahmad
{"title":"Feature and instances selection for nearest neighbor classification via cooperative PSO","authors":"S. Ahmad","doi":"10.1109/WICT.2014.7077300","DOIUrl":null,"url":null,"abstract":"Data reduction is an essential task in the data preparation phase of knowledge discovery and data mining (KDD). The reduction method contains two techniques, namely features reduction and data reduction which are commonly applied to a classification problem. The solution of data reduction can be viewed as a search problem. Therefore, it can be solved by using population-based techniques such as Genetic Algorithm and Particle Swarm Optimization. This paper proposes the integration of feature reduction and data reduction for Nearest Neighbor (NN) classification using Cooperative Binary Particle Swarm Optimization (CBPSO). This method can overcome the limitation of using the Nearest Neighbor (NN) classifier when dealing with high dimensional and large data. The proposed method is applied to 14 real world dataset from the machine learning repository. The algorithm's performance is illustrated by the corresponding table of the classification rate. The experimental results demonstrate the effectiveness of our proposed method.","PeriodicalId":439852,"journal":{"name":"2014 4th World Congress on Information and Communication Technologies (WICT 2014)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 4th World Congress on Information and Communication Technologies (WICT 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WICT.2014.7077300","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Data reduction is an essential task in the data preparation phase of knowledge discovery and data mining (KDD). The reduction method contains two techniques, namely features reduction and data reduction which are commonly applied to a classification problem. The solution of data reduction can be viewed as a search problem. Therefore, it can be solved by using population-based techniques such as Genetic Algorithm and Particle Swarm Optimization. This paper proposes the integration of feature reduction and data reduction for Nearest Neighbor (NN) classification using Cooperative Binary Particle Swarm Optimization (CBPSO). This method can overcome the limitation of using the Nearest Neighbor (NN) classifier when dealing with high dimensional and large data. The proposed method is applied to 14 real world dataset from the machine learning repository. The algorithm's performance is illustrated by the corresponding table of the classification rate. The experimental results demonstrate the effectiveness of our proposed method.
基于协同粒子群算法的最近邻分类特征和实例选择
数据约简是知识发现和数据挖掘(KDD)中数据准备阶段的重要任务。约简方法包含两种技术,即特征约简和数据约简,这两种技术通常应用于分类问题。数据约简的解决可以看作是一个搜索问题。因此,可以利用遗传算法和粒子群优化等基于种群的技术来解决这一问题。提出了一种将特征约简与数据约简相结合的基于协作二粒子群优化(CBPSO)的最近邻分类方法。该方法克服了使用最近邻(NN)分类器处理高维大数据时的局限性。将该方法应用于来自机器学习存储库的14个真实数据集。算法的性能由相应的分类率表来说明。实验结果证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信