TY - GEN
T1 - Multiple classifiers based incremental learning algorithm for learning in nonstationary environments
AU - Muhlbaier, Michael D.
AU - Polikar, Robi
PY - 2007
Y1 - 2007
N2 - We describe an incremental learning algorithm designed to learn in challenging non-stationary environments, where the underlying data distribution that governs the classification problem changes at an unknown rate. The algorithm is based on a multiple classifier system that generates a new classifier every time a new dataset becomes available from the changing environment. We consider the particularly challenging form of this problem, where we assume that the previously generated data points are no longer available, even if some of those points may still be relevant in the new environment. The algorithm employs a strategic weighting mechanism to determine the error of each classifier on the current data distribution, and then combines the classifiers using a dynamically weighted majority voting. We describe the implementation details of algorithm, and track its performance as a function of the environment's rate of change. We show that the algorithm is able to track the changing environment, even when the environment changes drastically over a short period of time.
AB - We describe an incremental learning algorithm designed to learn in challenging non-stationary environments, where the underlying data distribution that governs the classification problem changes at an unknown rate. The algorithm is based on a multiple classifier system that generates a new classifier every time a new dataset becomes available from the changing environment. We consider the particularly challenging form of this problem, where we assume that the previously generated data points are no longer available, even if some of those points may still be relevant in the new environment. The algorithm employs a strategic weighting mechanism to determine the error of each classifier on the current data distribution, and then combines the classifiers using a dynamically weighted majority voting. We describe the implementation details of algorithm, and track its performance as a function of the environment's rate of change. We show that the algorithm is able to track the changing environment, even when the environment changes drastically over a short period of time.
UR - http://www.scopus.com/inward/record.url?scp=38049062150&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38049062150&partnerID=8YFLogxK
U2 - 10.1109/ICMLC.2007.4370774
DO - 10.1109/ICMLC.2007.4370774
M3 - Conference contribution
AN - SCOPUS:38049062150
SN - 142440973X
SN - 9781424409730
T3 - Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007
SP - 3618
EP - 3623
BT - Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007
T2 - 6th International Conference on Machine Learning and Cybernetics, ICMLC 2007
Y2 - 19 August 2007 through 22 August 2007
ER -