In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
In this work, we developed classifiers to distinguish between four ovarian tumor types using Bayesian least squares support vector machines (LS-SVMs) and kernel logistic regression...
Ben Van Calster, Dirk Timmerman, Antonia C. Testa,...
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...