Combining classification improvements by ensemble processing

N. Ishii, Eisuke Tsuchiya, Y. Bao, N. Yamaguchi
{"title":"Combining classification improvements by ensemble processing","authors":"N. Ishii, Eisuke Tsuchiya, Y. Bao, N. Yamaguchi","doi":"10.1109/SERA.2005.30","DOIUrl":null,"url":null,"abstract":"The k-nearest neighbor (KNN) classification is a simple and effective classification approach. However, improving performance of the classifier is still attractive. Combining multiple classifiers is an effective technique for improving accuracy. There are many general combining algorithms, such as Bagging, Boosting, or Error Correcting Output Coding that significantly improve the classifier such as decision trees, rule learners, or neural networks. Unfortunately, these combining methods developed do not improve the nearest neighbor classifiers. In this paper, first, we present a new approach to combine multiple KNN classifiers based on different distance functions, in which we apply multiple distance functions to improve the performance of the k-nearest neighbor classifier. Second, we develop a combining method, in which the weights of the distance function are learnt by genetic algorithm. Finally, combining classifiers in error correcting output coding, are discussed. The proposed algorithms seek to increase generalization accuracy when compared to the basic k-nearest neighbor algorithm. Experiments have been conducted on some benchmark datasets from the UCI machine learning repository. The results show that the proposed algorithms improve the performance of the k-nearest neighbor classification.","PeriodicalId":424175,"journal":{"name":"Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SERA.2005.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

The k-nearest neighbor (KNN) classification is a simple and effective classification approach. However, improving performance of the classifier is still attractive. Combining multiple classifiers is an effective technique for improving accuracy. There are many general combining algorithms, such as Bagging, Boosting, or Error Correcting Output Coding that significantly improve the classifier such as decision trees, rule learners, or neural networks. Unfortunately, these combining methods developed do not improve the nearest neighbor classifiers. In this paper, first, we present a new approach to combine multiple KNN classifiers based on different distance functions, in which we apply multiple distance functions to improve the performance of the k-nearest neighbor classifier. Second, we develop a combining method, in which the weights of the distance function are learnt by genetic algorithm. Finally, combining classifiers in error correcting output coding, are discussed. The proposed algorithms seek to increase generalization accuracy when compared to the basic k-nearest neighbor algorithm. Experiments have been conducted on some benchmark datasets from the UCI machine learning repository. The results show that the proposed algorithms improve the performance of the k-nearest neighbor classification.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
结合集成处理的分类改进
KNN分类是一种简单有效的分类方法。然而,提高分类器的性能仍然是有吸引力的。多分类器组合是提高准确率的有效方法。有许多通用的组合算法,如Bagging、Boosting或纠错输出编码,可以显著改善分类器,如决策树、规则学习器或神经网络。不幸的是,这些组合方法并没有改进最近邻分类器。本文首先提出了一种基于不同距离函数组合多个KNN分类器的新方法,利用多个距离函数来提高k近邻分类器的性能。其次,我们提出了一种组合方法,通过遗传算法学习距离函数的权值。最后,结合分类器对输出编码的纠错进行了讨论。与基本的k近邻算法相比,所提出的算法寻求提高泛化精度。在UCI机器学习存储库的一些基准数据集上进行了实验。结果表明,所提算法提高了k近邻分类的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Binary component adaptation technique and supporting tool A performance comparison of on-demand routing protocols for application data in mobile ad hoc networks Object-oriented configuration management technology can improve software architectural traceability Intelligent code analyzer for online course management system Proactive self-healing system based on multi-agent technologies
×
引用
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