paper-with-me

홈 › Papers

GOOWE: Geometrically Optimum and Online-Weighted Ensemble Classifier for Evolving Data Streams

2017-09-08 · Hamed R. Bonab, Fazli Can

Designing adaptive classifiers for an evolving data stream is a challenging task due to the data size and its dynamically changing nature. Combining individual classifiers in an online setting, the ensemble approach, is a well-known solution. It is possible that a subset of classifiers in the ensemble outperforms others in a time-varying fashion. However, optimum weight assignment for component classifiers is a problem which is not yet fully addressed in online evolving environments. We propose a novel data stream ensemble classifier, called Geometrically Optimum and Online-Weighted Ensemble (GOOWE), which assigns optimum weights to the component classifiers using a sliding window containing the most recent data instances. We map vote scores of individual classifiers and true class labels into a spatial environment. Based on the Euclidean distance between vote scores and ideal-points, and using the linear least squares (LSQ) solution, we present a novel, dynamic, and online weighting approach. While LSQ is used for batch mode ensemble classifiers, it is the first time that we adapt and use it for online environments by providing a spatial modeling of online ensembles. In order to show the robustness of the proposed algorithm, we use real-world datasets and synthetic data generators using the MOA libraries. First, we analyze the impact of our weighting system on prediction accuracy through two scenarios. Second, we compare GOOWE with 8 state-of-the-art ensemble classifiers in a comprehensive experimental environment. Our experiments show that GOOWE provides improved reactions to different types of concept drift compared to our baselines. The statistical tests indicate a significant improvement in accuracy, with conservative time and memory requirements.

📄 PDF Abstract BibTeX arXiv:1709.02800

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A Novel Online Stacked Ensemble for Multi-Label Stream Classification

2018-09-26 · Alican Büyükçakır, Hamed Bonab, Fazli Can

As data streams become more prevalent, the necessity for online algorithms that mine this transient and dynamic data becomes clearer. Multi-label data stream classification is a supervised learning problem where each ins…

ClassificationGeneral ClassificationMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATION

Ensemble Performance Through the Lens of Linear Independence of Classifier Votes in Data Streams

2025-11-26 · Enes Bektas, Fazli Can arxiv

Ensemble learning improves classification performance by combining multiple base classifiers. While increasing the number of classifiers generally enhances accuracy, excessively large ensembles can lead to computational …

Ensemble Learning

Online Weighted Q-Ensembles for Reduced Hyperparameter Tuning in Reinforcement Learning

2022-09-29 · Renata Garcia, Wouter Caarls

Reinforcement learning is a promising paradigm for learning robot control, allowing complex control policies to be learned without requiring a dynamics model. However, even state of the art algorithms can be difficult to…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Cascading Randomized Weighted Majority: A New Online Ensemble Learning Algorithm

2014-03-03 · Mohammadzaman Zamani, Hamid Beigy, Amirreza Shaban

With the increasing volume of data in the world, the best approach for learning from this data is to exploit an online learning algorithm. Online ensemble methods are online algorithms which take advantage of an ensemble…

Ensemble Learning

A Unified Geometric Framework for Weighted Contrastive Learning

2026-05-13 · Raphael Vock, Edouard Duchesnay, Benoit Dufumier arxiv

Contrastive learning (CL) aims to preserve relational structure between samples by learning representations that reflect a similarity graph. Yet, the geometry of the resulting embeddings remains poorly understood. Here w…

Contrastive Learning