535 search results - page 1 / 107 » Generalized Version Space Trees |
KDID
2003
13 years 6 months ago
2003
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...
KCAP
2003
ACM
13 years 10 months ago
2003
ACM
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 ...
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
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...
ECCC
2010
13 years 3 months ago
2010
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...
DISOPT
2010
13 years 5 months ago
2010
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...