未来选择的改进布谷鸟搜索算法

T. Mathi Murugan, E. Baburaj
{"title":"未来选择的改进布谷鸟搜索算法","authors":"T. Mathi Murugan, E. Baburaj","doi":"10.22232/stj.2021.09.02.14","DOIUrl":null,"url":null,"abstract":"The classification of high-dimensional dataset is challenging as it contains large amount irrelevant and noisy features. Thus, feature selection is performed in the dataset to eliminate these redundant features. It reduces the dimensionality of the dataset and increases the classification accuracy. Hence, for selecting the relevant features in high dimensional data, an improved cuckoo search algorithm (ICSA) was proposed in this paper. After feature selection, the dataset undergo classification using KNN classifier and SVM classifier. The experimental process illustrates that the improved cuckoo search algorithm effectively increases the classification accuracy by reducing the number of features in the dataset. For analysing the proposed algorithm, seven UCI repository dataset have been utilised. Also, the ICS algorithm is compared with other existing algorithms for the given dataset. From the investigation process, it was concluded that the proposed algorithm selects lesser number of features and also enhances the classification accuracy than the other existing algorithms.","PeriodicalId":22107,"journal":{"name":"Silpakorn University Science and Technology Journal","volume":"69 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improved Cuckoo Search Algorithm for Future Selection\",\"authors\":\"T. Mathi Murugan, E. Baburaj\",\"doi\":\"10.22232/stj.2021.09.02.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The classification of high-dimensional dataset is challenging as it contains large amount irrelevant and noisy features. Thus, feature selection is performed in the dataset to eliminate these redundant features. It reduces the dimensionality of the dataset and increases the classification accuracy. Hence, for selecting the relevant features in high dimensional data, an improved cuckoo search algorithm (ICSA) was proposed in this paper. After feature selection, the dataset undergo classification using KNN classifier and SVM classifier. The experimental process illustrates that the improved cuckoo search algorithm effectively increases the classification accuracy by reducing the number of features in the dataset. For analysing the proposed algorithm, seven UCI repository dataset have been utilised. Also, the ICS algorithm is compared with other existing algorithms for the given dataset. From the investigation process, it was concluded that the proposed algorithm selects lesser number of features and also enhances the classification accuracy than the other existing algorithms.\",\"PeriodicalId\":22107,\"journal\":{\"name\":\"Silpakorn University Science and Technology Journal\",\"volume\":\"69 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Silpakorn University Science and Technology Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22232/stj.2021.09.02.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Silpakorn University Science and Technology Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22232/stj.2021.09.02.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于高维数据集包含大量的不相关和噪声特征,因此对高维数据集的分类具有挑战性。因此,在数据集中进行特征选择以消除这些冗余特征。它降低了数据集的维数,提高了分类精度。为此,本文提出了一种改进的杜鹃搜索算法(ICSA),用于高维数据中相关特征的选取。特征选择完成后,使用KNN分类器和SVM分类器对数据集进行分类。实验过程表明,改进的布谷鸟搜索算法通过减少数据集中的特征数量,有效地提高了分类精度。为了分析所提出的算法,使用了七个UCI存储库数据集。同时,针对给定的数据集,将ICS算法与其他现有算法进行了比较。从研究过程中可以看出,与其他现有算法相比,该算法选择的特征数量较少,分类精度也有所提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Improved Cuckoo Search Algorithm for Future Selection
The classification of high-dimensional dataset is challenging as it contains large amount irrelevant and noisy features. Thus, feature selection is performed in the dataset to eliminate these redundant features. It reduces the dimensionality of the dataset and increases the classification accuracy. Hence, for selecting the relevant features in high dimensional data, an improved cuckoo search algorithm (ICSA) was proposed in this paper. After feature selection, the dataset undergo classification using KNN classifier and SVM classifier. The experimental process illustrates that the improved cuckoo search algorithm effectively increases the classification accuracy by reducing the number of features in the dataset. For analysing the proposed algorithm, seven UCI repository dataset have been utilised. Also, the ICS algorithm is compared with other existing algorithms for the given dataset. From the investigation process, it was concluded that the proposed algorithm selects lesser number of features and also enhances the classification accuracy than the other existing algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Advance Theft Detection System (ATHEDES) for Portable Industrial Gamma Radiography Exposure Device CNN based Gait Analysis for Human Identification in Covariate Conditions Some Curvature Properties of Kenmostsu Manifolds with Generalised Tanaka-Webster Connection Recent Developments in Application of Plants Oils and Extract as Corrosion Inhibitors for Steel Corrosion in Acid Media Intramolecular Cyclization of N-hydroxy-3-phenylpropanamides and N-hydroxy-4-phenylbutanamides
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1