This article describes a new model of probability density function and its use in estimation of distribution algorithms. The new model, the distribution tree, has interesting prope...
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
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...