Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Daniel Nowak Assis

dblp:353/6809 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
5since 2021 · last 2025
0000-0002-0975-8665ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Databases, data management, data science and information retrieval · 3 · 3 first-author · 3 since 2021
YearPublicationVenuePosition
2025 Adaptive Options for Decision Trees in Evolving Data Stream Classification
Daniel Nowak Assis, Jean Paul Barddal, Fabrício Enembreck
ECML/PKDD (7)1
2025 Behavioral insights of adaptive splitting decision trees in evolving data stream classification
Daniel Nowak Assis, Jean Paul Barddal, Fabrício Enembreck
Knowl. Inf. Syst.1
2025 ADWIN-U: adaptive windowing for unsupervised drift detection on data streams
Daniel Nowak Assis, Vinícius M. A. de Souza
Knowl. Inf. Syst.1
2023 Learning with Boosting Decision Stumps for Feature Selection in Evolving Data Streams
abstract
Feature selection plays an important role in Machine Learning pipelines, and many challenges emerge for feature selection when data arrives continuously as a stream.In this paper, we extend the Adaptive Boosting for Feature Selection (ABFS) algorithm by (i) using a different Online Boosting strategy and (ii) changing the Boosting scaling factor of instances weighting.Results show that our extended ABFS leveraged the predictive performance of classifiers more than the standard ABFS in the most used monolithic classifiers for stream mining.2 Feature Selection with Boosting Decision Stumps 1 https://sites.google.com
Daniel Nowak Assis
ESANN1
2023 Mass-Based Short Term Selection of Classifiers in Data Streams
abstract
Dynamic classifier selection (DCS) regards well-known machine learning techniques in the batch setting that leverage ensemble performance. Most of the methods use similarity-based methods as a proxy, culminating in high computation costs and becoming unfeasible in many streaming scenarios. In this paper, we propose a DCS method able to cope with the high-speed streaming setting, which is based on the performance of base learners in the most recent instances. The impact of our method is evaluated with different ensembles for data streams. We also propose modifications to an Online Boosting method, which has its performance improved with DCS. Our method increases the accuracy and kappa statistic of state-of-the-art ensembles with low overhead of time processing and memory.
Daniel Nowak Assis, Fabrício Enembreck, Jean Paul Barddal
IJCNN1