The ternary search tree (TST) is the champion of data structure acrobatics — it finds all keys having a given prefix, suffix, or infix. It even finds those keys that closely match a given ...

Decision trees often give simple descriptions of complex, nonlinear relationships between several predictors and a univariate or multivariate response. But if the response is a high-dimensional vector ...