We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Although version space support vector machines (VSSVMs) are a successful approach to reliable classification [6], they are restricted to separable data. This paper proposes gener...
Evgueni N. Smirnov, Ida G. Sprinkhuizen-Kuyper, Ni...
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...