Ensemble of classifiers based incremental learning with dynamic voting weight update

R. Polikar, S. Krause, L. Burd
{"title":"Ensemble of classifiers based incremental learning with dynamic voting weight update","authors":"R. Polikar, S. Krause, L. Burd","doi":"10.1109/IJCNN.2003.1224006","DOIUrl":null,"url":null,"abstract":"An incremental learning algorithm based on weighted majority voting of an ensemble of classifiers is introduced for supervised neural networks, where the voting weights are updated dynamically based on the current test input of unknown class. The algorithm's dynamic voting weight update feature is an enhancement to our previously introduced incremental learning algorithm, Learn++. The algorithm is capable of incrementally learning new information from additional datasets that may later become available, even when the new datasets include instances from additional classes that were not previously seen. Furthermore, the algorithm retains formerly acquired knowledge without requiring access to datasets used earlier, attaining a delicate balance on the stability-plasticity dilemma. The algorithm creates additional ensembles of classifiers based on an iteratively updated distribution function on the training data that favors training with increasingly difficult to learn, previously not learned and/or unseen instances. The final classification is made by weighted majority voting of all classifier outputs in the ensemble, where the voting weights are determined dynamically during actual testing, based on the estimated performance of each classifier on the current test data instance. We present the algorithm in its entirety, as well as its promising simulation results on two real world applications.","PeriodicalId":310128,"journal":{"name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","volume":"18 9","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Joint Conference on Neural Networks, 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN.2003.1224006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

An incremental learning algorithm based on weighted majority voting of an ensemble of classifiers is introduced for supervised neural networks, where the voting weights are updated dynamically based on the current test input of unknown class. The algorithm's dynamic voting weight update feature is an enhancement to our previously introduced incremental learning algorithm, Learn++. The algorithm is capable of incrementally learning new information from additional datasets that may later become available, even when the new datasets include instances from additional classes that were not previously seen. Furthermore, the algorithm retains formerly acquired knowledge without requiring access to datasets used earlier, attaining a delicate balance on the stability-plasticity dilemma. The algorithm creates additional ensembles of classifiers based on an iteratively updated distribution function on the training data that favors training with increasingly difficult to learn, previously not learned and/or unseen instances. The final classification is made by weighted majority voting of all classifier outputs in the ensemble, where the voting weights are determined dynamically during actual testing, based on the estimated performance of each classifier on the current test data instance. We present the algorithm in its entirety, as well as its promising simulation results on two real world applications.
基于分类器增量学习与动态投票权更新的集成
针对有监督神经网络,提出了一种基于分类器集合加权多数投票的增量学习算法,该算法根据未知类的当前测试输入动态更新投票权重。该算法的动态投票权重更新功能是对我们之前介绍的增量学习算法Learn++的增强。该算法能够从以后可能可用的其他数据集中逐步学习新信息,即使新数据集包含以前未见过的其他类的实例。此外,该算法保留了先前获得的知识,而不需要访问先前使用的数据集,从而在稳定性-可塑性困境中实现了微妙的平衡。该算法基于训练数据上迭代更新的分布函数创建额外的分类器集成,该分布函数有利于具有越来越难学习,以前未学习和/或未见实例的训练。最终的分类是通过对集成中所有分类器输出的加权多数投票进行的,其中投票权重是在实际测试期间根据每个分类器在当前测试数据实例上的估计性能动态确定的。我们给出了整个算法,以及它在两个实际应用中的有希望的模拟结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.80
自引率
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学术官方微信
小红书