Heitor Murilo Gomes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Heitor Murilo Gomes has a total of 98 co-authors. Here are the top co-authors by number of shared publications:
- Albert Bifet
AI Institute, University of Waikato, Hamilton, Waikato, New Zealand and LTCI, Télécom Paris, IP Paris, Paris, France
31 shared publications - Bernhard Pfahringer
University of Waikato
24 shared publications - Fabrício Enembreck
Programa de Pós-Graduação em Informática (PPGIA), Pontifícia Universidade Católica do Paraná (PUCPR), Curitiba, Brazil
21 shared publications - Jean Paul Barddal
Programa de Pós-Graduação em Informática (PPGIA), Pontifícia Universidade Católica do Paraná (PUCPR), Curitiba, Brazil
19 shared publications - Yibin Sun
Victoria University of Wellington
8 shared publications Bernhard Pfahringer
University of Waikato
4 shared publications
Latest Publications
- 17 October 2026
- Published by Springer Nature
- p. 495-509
Hidden-Context Drift Simulation for Realistic Stream Benchmarks
- 17 October 2026
- Published by Springer Nature
- p. 495-509
Hidden-Context Drift Simulation for Realistic Stream Benchmarks
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 8671-8682
A Framework for Evaluating and Benchmarking Concept Drift Detection Methods
Data stream mining is fundamentally challenged by concept drift, where distributional changes can degrade model performance. Despite the proliferation of drift detection methods, progress in the field is hindered by inconsistent evaluation practices: studies rely on oversimplified synthetic data generators, adopt incompatible metrics, and lack transparency in hyperparameter selection, making fair comparisons difficult. We address this gap with a novel benchmarking framework comprising three contributions: (1) a drift simulation method that injects controlled distributional changes into real-world datasets via Monte Carlo trials, enabling supervised evaluation while preserving real-world data complexity; (2) an evaluation protocol for drift detection with timing-aware criteria, including the derivation of new metrics (e.g., F1 detection score, normalized detection time) that are comparable across streams; and (3) we advocate for a leave-one-dataset-out hyperparameter optimization protocol for drift detection methods that promotes configuration robustness across heterogeneous stream dynamics. We benchmark 14 widely used drift detection methods on 7 real-world datasets across 4 drift types (class prior, label swap, feature permutation, feature filtering), each under both abrupt and gradual transitions. Our experimental results provide insights into the strengths and weaknesses of current drift detection approaches while establishing baseline performance metrics for future research in this area. All code and experiments are publicly available.
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 8671-8682
Open AccessA Framework for Evaluating and Benchmarking Concept Drift Detection Methods
Data stream mining is fundamentally challenged by concept drift, where distributional changes can degrade model performance. Despite the proliferation of drift detection methods, progress in the field is hindered by inconsistent evaluation practices: studies rely on oversimplified synthetic data generators, adopt incompatible metrics, and lack transparency in hyperparameter selection, making fair comparisons difficult. We address this gap with a novel benchmarking framework comprising three contributions: (1) a drift simulation method that injects controlled distributional changes into real-world datasets via Monte Carlo trials, enabling supervised evaluation while preserving real-world data complexity; (2) an evaluation protocol for drift detection with timing-aware criteria, including the derivation of new metrics (e.g., F1 detection score, normalized detection time) that are comparable across streams; and (3) we advocate for a leave-one-dataset-out hyperparameter optimization protocol for drift detection methods that promotes configuration robustness across heterogeneous stream dynamics. We benchmark 14 widely used drift detection methods on 7 real-world datasets across 4 drift types (class prior, label swap, feature permutation, feature filtering), each under both abrupt and gradual transitions. Our experimental results provide insights into the strengths and weaknesses of current drift detection approaches while establishing baseline performance metrics for future research in this area. All code and experiments are publicly available.
- Open Access
- 24 July 2026
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 68 (1) , 227
Adaptive approaches towards fully incremental prediction interval for data stream regression
Prediction intervals (PIs) are a practical tool for uncertainty quantification in regression, but comparatively little work has addressed fully incremental PI generation for data streams. In streaming settings, data arrive continuously, each instance is typically processed once, and concept drift can quickly invalidate a previously well-calibrated interval. These properties make many batch PI methods and window-based adaptations difficult to apply efficiently. This paper studies Adaptive Prediction Interval (AdaPI), an online post-calibration framework that adjusts interval width according to observed coverage. We instantiate the framework with a fully incremental variant of Mean and Variance Estimation (MVE) and investigate three adaptive scaling functions. We also adopt an evaluation perspective that jointly considers coverage accuracy and interval width. Experiments on a collection of real-world and synthetic regression streams show that AdaPI can often move coverage closer to the desired confidence level while maintaining competitive interval width; under the default 95% confidence setting and coverage-heavy CING weighting, the linear variant frequently gives the strongest empirical coverage–width trade-off among the three adaptive strategies.
- 24 July 2026
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 68 (1) , 227
Open AccessAdaptive approaches towards fully incremental prediction interval for data stream regression
Prediction intervals (PIs) are a practical tool for uncertainty quantification in regression, but comparatively little work has addressed fully incremental PI generation for data streams. In streaming settings, data arrive continuously, each instance is typically processed once, and concept drift can quickly invalidate a previously well-calibrated interval. These properties make many batch PI methods and window-based adaptations difficult to apply efficiently. This paper studies Adaptive Prediction Interval (AdaPI), an online post-calibration framework that adjusts interval width according to observed coverage. We instantiate the framework with a fully incremental variant of Mean and Variance Estimation (MVE) and investigate three adaptive scaling functions. We also adopt an evaluation perspective that jointly considers coverage accuracy and interval width. Experiments on a collection of real-world and synthetic regression streams show that AdaPI can often move coverage closer to the desired confidence level while maintaining competitive interval width; under the default 95% confidence setting and coverage-heavy CING weighting, the linear variant frequently gives the strongest empirical coverage–width trade-off among the three adaptive strategies.
- 1 May 2026
- Published by Springer Nature
- p. 669-677
Detecting Domain Shifts in Myoelectric Activations: Challenges and Opportunities in Stream Learning
- 1 May 2026
- Published by Springer Nature
- p. 669-677
Detecting Domain Shifts in Myoelectric Activations: Challenges and Opportunities in Stream Learning
- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (3) , 1973-1985
SLEADE: Disagreement-Based Semi-Supervised Learning for Sparsely Labeled Evolving Data Streams
Semi-supervised learning (SSL) problems are challenging, appear in many domains, and are particularly relevant to streaming applications, where data are abundant but labels are not. The problem tackled here is classification over an evolving data stream where labels are rare and distributed randomly. We propose SLEADE (Stream LEArning by Disagreement Ensemble), a novel method that exploits disagreement-based learning and unsupervised drift detection to leverage unlabeled data during training. SLEADE uses pseudo-labeled instances to augment the training set of each member of an ensemble using a majority trains the minority scheme. The pseudo-labeled data impact is controlled by a weighting function that considers the confidence in the prediction attributed by the ensemble members. SLEADE exploits unsupervised drift detection, which allows the ensemble to respond to changes. We present several experiments using real and synthetic data to illustrate the benefits and limitations of SLEADE compared to existing algorithms.
- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (3) , 1973-1985
SLEADE: Disagreement-Based Semi-Supervised Learning for Sparsely Labeled Evolving Data Streams
Semi-supervised learning (SSL) problems are challenging, appear in many domains, and are particularly relevant to streaming applications, where data are abundant but labels are not. The problem tackled here is classification over an evolving data stream where labels are rare and distributed randomly. We propose SLEADE (Stream LEArning by Disagreement Ensemble), a novel method that exploits disagreement-based learning and unsupervised drift detection to leverage unlabeled data during training. SLEADE uses pseudo-labeled instances to augment the training set of each member of an ensemble using a majority trains the minority scheme. The pseudo-labeled data impact is controlled by a weighting function that considers the confidence in the prediction attributed by the ensemble members. SLEADE exploits unsupervised drift detection, which allows the ensemble to respond to changes. We present several experiments using real and synthetic data to illustrate the benefits and limitations of SLEADE compared to existing algorithms.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2821-2831
Dynamic Ensemble Member Selection for Data Stream Classification
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2821-2831
Open AccessDynamic Ensemble Member Selection for Data Stream Classification
- 18 September 2025
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 39 (6) , 1-28
RMIDDM: an unsupervised and interpretable concept drift detection method for data streams
- 18 September 2025
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 39 (6) , 1-28
RMIDDM: an unsupervised and interpretable concept drift detection method for data streams
- Open Access
- 6 August 2025
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 39 (5) , 1-37
Gradient boosted bagging for evolving data stream regression
Gradient boosting has been extensively studied in batch learning. Recently, its streaming adaptation, Streaming Gradient Boosted Trees (Sgbt), has surpassed existing state-of-the-art random subspace and random patches methods for streaming classification under various drift scenarios. However, its application in streaming regression remains unexplored. Vanilla Sgbt with squared loss exhibits high variance when applied to streaming regression problems. To address this, we utilize bagging streaming regressors in this work to create Streaming Gradient Boosted Regression (Sgbr). Bagging streaming regressors are employed in two ways: first, as base learners within the existing Sgbt framework, and second, as an ensemble method that aggregates multiple Sgbts. Our extensive experiments on 11 streaming regression datasets, encompassing multiple drift scenarios, demonstrate that the Sgb(Oza), a variant of the first Sgbr category, significantly outperforms current state-of-the-art streaming regression methods in terms of both predictive power and computational cost.
- 6 August 2025
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 39 (5) , 1-37
Open AccessGradient boosted bagging for evolving data stream regression
Gradient boosting has been extensively studied in batch learning. Recently, its streaming adaptation, Streaming Gradient Boosted Trees (Sgbt), has surpassed existing state-of-the-art random subspace and random patches methods for streaming classification under various drift scenarios. However, its application in streaming regression remains unexplored. Vanilla Sgbt with squared loss exhibits high variance when applied to streaming regression problems. To address this, we utilize bagging streaming regressors in this work to create Streaming Gradient Boosted Regression (Sgbr). Bagging streaming regressors are employed in two ways: first, as base learners within the existing Sgbt framework, and second, as an ensemble method that aggregates multiple Sgbts. Our extensive experiments on 11 streaming regression datasets, encompassing multiple drift scenarios, demonstrate that the Sgb(Oza), a variant of the first Sgbr category, significantly outperforms current state-of-the-art streaming regression methods in terms of both predictive power and computational cost.
- 22 July 2025
- Published by Springer Nature
- p. 348-362
CLOFAI: A Dataset of Real And Fake Image Classification Tasks for Continual Learning
- 22 July 2025
- Published by Springer Nature
- p. 348-362
CLOFAI: A Dataset of Real And Fake Image Classification Tasks for Continual Learning
- 10 July 2025
- Published by Springer Nature
- p. 3-24
Towards Explainable Drift Detection and Early Retrain in ML-Based Malware Detection Pipelines
- 10 July 2025
- Published by Springer Nature
- p. 3-24
Towards Explainable Drift Detection and Early Retrain in ML-Based Malware Detection Pipelines