A new classification algorithm based on ensemble PSO_SVM and clustering analysis

T. Zhou, Huiling Lu, Lihua Liu, Longquan Yong, Shouheng Tuo
{"title":"A new classification algorithm based on ensemble PSO_SVM and clustering analysis","authors":"T. Zhou, Huiling Lu, Lihua Liu, Longquan Yong, Shouheng Tuo","doi":"10.1109/GrC.2012.6468652","DOIUrl":null,"url":null,"abstract":"Aiming at the existing problems of support vector machine ensemble, such as strong randomicity, larger scale of training subsets size and high complexity of ensemble classifier, this paper put forward a novel SVM ensemble construction method based on clustering analysis. Firstly, the samples are clustered into several clusters according to their distribution with rival penalty competitive learning algorithm(RPCL). Then a small quantity of representative instances are chosen as training sets and training SVM that adopt self-perturbation in population convergence speed. Finally Ensemble improvement SVM is constructed by relative majority voting. Man-made data are used to test C_PSOSVM. Experiment result illustrate that the algorithm can improve ensemble SVM classification precision, reducing time-space complexity compared with Bagging, Adaboost.","PeriodicalId":126161,"journal":{"name":"IEEE International Conference on Granular Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Granular Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GrC.2012.6468652","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Aiming at the existing problems of support vector machine ensemble, such as strong randomicity, larger scale of training subsets size and high complexity of ensemble classifier, this paper put forward a novel SVM ensemble construction method based on clustering analysis. Firstly, the samples are clustered into several clusters according to their distribution with rival penalty competitive learning algorithm(RPCL). Then a small quantity of representative instances are chosen as training sets and training SVM that adopt self-perturbation in population convergence speed. Finally Ensemble improvement SVM is constructed by relative majority voting. Man-made data are used to test C_PSOSVM. Experiment result illustrate that the algorithm can improve ensemble SVM classification precision, reducing time-space complexity compared with Bagging, Adaboost.
基于集成PSO_SVM和聚类分析的分类算法
针对支持向量机集成存在的随机性强、训练子集规模较大、集成分类器复杂度高等问题,提出了一种基于聚类分析的支持向量机集成构建方法。首先,采用对手惩罚竞争学习算法(RPCL),根据样本的分布将其聚类成若干类;然后选取少量具有代表性的实例作为训练集,训练采用种群收敛速度自摄的支持向量机。最后采用相对多数投票法构造集成改进支持向量机。利用人工数据对C_PSOSVM进行测试。实验结果表明,与Bagging、Adaboost相比,该算法可以提高集成支持向量机的分类精度,降低时间空间复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信