no code implementations • 8 Feb 2023 • Marco Bressan, Mauro Sozio
We give the first algorithm that maintains an approximate decision tree over an arbitrary sequence of insertions and deletions of labeled examples, with strong guarantees on the worst-case running time per update request.
no code implementations • 1 Dec 2022 • Marco Bressan, Gabriel Damay, Mauro Sozio
We develop the first fully dynamic algorithm that maintains a decision tree over an arbitrary sequence of insertions and deletions of labeled examples.
1 code implementation • 5 Dec 2019 • Oana Balalau, Carlos Castillo, Mauro Sozio
Despite the significant efforts made by the research community in recent years, automatically acquiring valuable information about high impact-events from social media remains challenging.
