一种新的用于数据分类的离散粒子群

N. K. Khan, A. R. Baig, M. Iqbal
{"title":"一种新的用于数据分类的离散粒子群","authors":"N. K. Khan, A. R. Baig, M. Iqbal","doi":"10.1109/ICISA.2010.5480366","DOIUrl":null,"url":null,"abstract":"In this paper we have presented a new Discrete Particle Swarm Optimization approach to induce rules from the discrete data. The proposed algorithm initializes its population by taking into account the discrete nature of the data. It assigns different fixed probabilities to current, local best and the global best positions. Based on these probabilities, each member of the population updates its position iteratively. The performance of the proposed algorithm is evaluated on five different datasets and compared against 9 different classification techniques. The algorithm produces promising results by creating highly accurate rules for each dataset.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A New Discrete PSO for Data Classification\",\"authors\":\"N. K. Khan, A. R. Baig, M. Iqbal\",\"doi\":\"10.1109/ICISA.2010.5480366\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we have presented a new Discrete Particle Swarm Optimization approach to induce rules from the discrete data. The proposed algorithm initializes its population by taking into account the discrete nature of the data. It assigns different fixed probabilities to current, local best and the global best positions. Based on these probabilities, each member of the population updates its position iteratively. The performance of the proposed algorithm is evaluated on five different datasets and compared against 9 different classification techniques. The algorithm produces promising results by creating highly accurate rules for each dataset.\",\"PeriodicalId\":313762,\"journal\":{\"name\":\"2010 International Conference on Information Science and Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Information Science and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISA.2010.5480366\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Information Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISA.2010.5480366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

本文提出了一种新的离散粒子群优化方法,从离散数据中归纳出规则。该算法通过考虑数据的离散性来初始化其种群。它将不同的固定概率分配给当前、局部和全局最佳位置。基于这些概率,种群中的每个成员迭代地更新其位置。在5个不同的数据集上评估了该算法的性能,并与9种不同的分类技术进行了比较。该算法通过为每个数据集创建高度精确的规则来产生有希望的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Discrete PSO for Data Classification
In this paper we have presented a new Discrete Particle Swarm Optimization approach to induce rules from the discrete data. The proposed algorithm initializes its population by taking into account the discrete nature of the data. It assigns different fixed probabilities to current, local best and the global best positions. Based on these probabilities, each member of the population updates its position iteratively. The performance of the proposed algorithm is evaluated on five different datasets and compared against 9 different classification techniques. The algorithm produces promising results by creating highly accurate rules for each dataset.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信