11 citations · 18 across the 8 of their papers we have counts for
4 papers · 1 filter
Robust Optimal Classification Trees Against Adversarial Examples
Daniël Vos, Sicco Verwer
Decision trees are a popular choice of explainable model, but just like neural networks, they suffer from adversarial examples. Existing algorithms for fitting decision trees robus…
Efficient Training of Robust Decision Trees Against Adversarial Examples
Daniël Vos, Sicco Verwer
In the present day we use machine learning for sensitive tasks that require models to be both understandable and robust. Although traditional models such as decision trees are unde…
Learning Pairwise Disjoint Simple Languages from Positive Examples
Alexis Linard, Rick Smetsers, Frits Vaandrager +3
A classical problem in grammatical inference is to identify a deterministic finite automaton (DFA) from a set of positive and negative examples. In this paper, we address the relat…
Anomaly Detection in a Digital Video Broadcasting System Using Timed Automata
Xiaoran Liu, Qin Lin, Sicco Verwer +1
This paper focuses on detecting anomalies in a digital video broadcasting (DVB) system from providers' perspective. We learn a probabilistic deterministic real timed automaton prof…