: It is well known that type constructors of incomplete trees (trees with variables) carry the structure of a monad with substitution as the extension operation. Less known are the...
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
Henrik Reif Andersen, Tarik Hadzic, John N. Hooker...
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...