T. Takagi

Linear Time Online Algorithms for Constructing Linear-size Suffix Trie

2023 · arXiv (Cornell University)

The suffix trees are fundamental data structures for various kinds of string processing. The suffix tree of a text string $T$ of length $n$ has $O(n)$ nodes and edges, and the string label of each …

Learning Decision Trees and Forests with Algorithmic Recourse

2024 · arXiv (Cornell University)

This paper proposes a new algorithm for learning accurate tree-based models while ensuring the existence of recourse actions. Algorithmic Recourse (AR) aims to provide a recourse action for altering the undesired prediction result given by …