一种基于Ripper和Adaboost的组合分类方法

Min Wang, Zuo Chen, Zhiqiang Zhang, Sangzhi Zhu, Shenggang Yang
{"title":"一种基于Ripper和Adaboost的组合分类方法","authors":"Min Wang, Zuo Chen, Zhiqiang Zhang, Sangzhi Zhu, Shenggang Yang","doi":"10.1504/IJES.2021.116109","DOIUrl":null,"url":null,"abstract":"With the growing demand for data analysis, machine learning technology has been widely used in many applications, such as mass data summarising rules, predicting behaviours and dividing characteristics. The Ripper algorithm presents better pruning and stopping criteria than the traditional decision tree algorithm (C4.5), while its error rate less than or equal to C4.5 by O(nlog2n) time complexity. As a result of that, Ripper can maintain high efficiency even on the massive dataset which contains lots of noise. Adaboost is one of iterative algorithms, which combines a group of weak classifiers together to set up a strong classifier. In order to improve the accuracy of Ripper classification algorithm and reduce the computational complexity, this paper proposes a Ripper-Adaboost combined classification method (Ripper-ADB). The experiment result shows Ripper-ADB could improve the classifier and get higher classification accuracy than decision tree and SVM.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A combination classification method based on Ripper and Adaboost\",\"authors\":\"Min Wang, Zuo Chen, Zhiqiang Zhang, Sangzhi Zhu, Shenggang Yang\",\"doi\":\"10.1504/IJES.2021.116109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the growing demand for data analysis, machine learning technology has been widely used in many applications, such as mass data summarising rules, predicting behaviours and dividing characteristics. The Ripper algorithm presents better pruning and stopping criteria than the traditional decision tree algorithm (C4.5), while its error rate less than or equal to C4.5 by O(nlog2n) time complexity. As a result of that, Ripper can maintain high efficiency even on the massive dataset which contains lots of noise. Adaboost is one of iterative algorithms, which combines a group of weak classifiers together to set up a strong classifier. In order to improve the accuracy of Ripper classification algorithm and reduce the computational complexity, this paper proposes a Ripper-Adaboost combined classification method (Ripper-ADB). The experiment result shows Ripper-ADB could improve the classifier and get higher classification accuracy than decision tree and SVM.\",\"PeriodicalId\":412308,\"journal\":{\"name\":\"Int. J. Embed. Syst.\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Embed. Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJES.2021.116109\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Embed. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJES.2021.116109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着数据分析需求的不断增长,机器学习技术在海量数据总结规则、预测行为、特征划分等应用中得到了广泛的应用。Ripper算法具有比传统决策树算法(C4.5)更好的剪枝和停止准则,其错误率小于等于C4.5 O(nlog2n)的时间复杂度。因此,即使在包含大量噪声的海量数据集上,Ripper也能保持较高的效率。Adaboost是一种迭代算法,它将一组弱分类器组合在一起,建立一个强分类器。为了提高Ripper分类算法的准确率,降低计算复杂度,本文提出了一种Ripper- adaboost组合分类方法(Ripper- adb)。实验结果表明,与决策树和支持向量机相比,Ripper-ADB可以提高分类器的分类精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A combination classification method based on Ripper and Adaboost
With the growing demand for data analysis, machine learning technology has been widely used in many applications, such as mass data summarising rules, predicting behaviours and dividing characteristics. The Ripper algorithm presents better pruning and stopping criteria than the traditional decision tree algorithm (C4.5), while its error rate less than or equal to C4.5 by O(nlog2n) time complexity. As a result of that, Ripper can maintain high efficiency even on the massive dataset which contains lots of noise. Adaboost is one of iterative algorithms, which combines a group of weak classifiers together to set up a strong classifier. In order to improve the accuracy of Ripper classification algorithm and reduce the computational complexity, this paper proposes a Ripper-Adaboost combined classification method (Ripper-ADB). The experiment result shows Ripper-ADB could improve the classifier and get higher classification accuracy than decision tree and SVM.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
NITIDS: a robust network intrusion dataset Solution to the conformable fractional differential systems with higher order Flexible heuristic-based prioritised latency-sensitive IoT application execution scheme in the 5G era Selection gate-based networks for semantic relation extraction A combination classification method based on Ripper and Adaboost
×
引用
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