Laurens Devos

dblp:257/5046 · DBLP profile ↗
← Back
4ranked-venue papers in the field
3as first author
3since 2021 · last 2026
0000-0002-1549-749XORCID · corroborated

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 4 (3 first)
YearPublicationVenuePosition
2026 SubTSMD: discovering subspace motifs with temporal variations in multivariate time series
Louis Carpentier, Laurens Devos, Wannes Meert, Mathias Verbeke
Data Min. Knowl. Discov.2
2023 Detecting Evasion Attacks in Deployed Tree Ensembles
Laurens Devos, Lorenzo Perini, Wannes Meert, Jesse Davis
ECML/PKDD (5)1
2021 Verifying Tree Ensembles by Reasoning about Potential Instances
abstract
Imagine being able to ask questions to a black box model such as "Which adversarial examples exist?", "Does a specific attribute have a disproportionate effect on the model's prediction?" or "What kind of predictions could possibly be made for a partially described example?" This last question is particularly important if your partial description does not correspond to any observed example in your data, as it provides insight into how the model will extrapolate to unseen data. These capabilities would be extremely helpful as they would allow a user to better understand the model's behavior, particularly as it relates to issues such as robustness, fairness, and bias. In this paper, we propose such an approach for an ensemble of trees. Since, in general, this task is intractable we present a strategy that (1) can prune part of the input space given the question asked to simplify the problem; and (2) follows a divide and conquer approach that is incremental and can always return some answers and indicates which parts of the input domains are still uncertain. The usefulness of our approach is shown on a diverse set of use cases.
Laurens Devos, Wannes Meert, Jesse Davis
SDM1
2019 Fast Gradient Boosting Decision Trees with Bit-Level Data Structures
Laurens Devos, Wannes Meert, Jesse Davis
ECML/PKDD (1)1