Publicaties
Gekozen filters:
Gekozen filters:
PAC-reasoning in relational domains KU Leuven
© 34th Conference on Uncertainty in Artificial Intelligence 2018. All rights reserved. We consider the problem of predicting plausible missing facts in relational data, given a set of imperfect logical rules. In particular, our aim is to provide bounds on the (expected) number of incorrect inferences that are made in this way. Since for classical inference it is in general impossible to bound this number in a non-trivial way, we consider two ...
Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model KU Leuven
© 2018, The Author(s). Counting the number of times a pattern occurs in a database is a fundamental data mining problem. It is a subroutine in a diverse set of tasks ranging from pattern mining to supervised learning and probabilistic model learning. While a pattern and a database can take many forms, this paper focuses on the case where both the pattern and the database are graphs (networks). Unfortunately, in general, the problem of counting ...
A machine learning based framework to identify and classify long terminal repeat retrotransposons KU Leuven Universiteit Gent
Transposable elements (TEs) are repetitive nucleotide sequences that make up a large portion of eukaryotic genomes. They can move and duplicate within a genome, increasing genome size and contributing to genetic diversity within and across species. Accurate identification and classification of TEs present in a genome is an important step towards understanding their effects on genes and their role in genome evolution. We introduce TE-Learner, a ...
Quantified Markov logic networks KU Leuven
Hoeffding's Inequality for Sums of Dependent Random Variables KU Leuven
We provide a systematic approach to deal with the following problem. Let$X_1,\ldots,X_n$ be, possibly dependent, $[0,1]$-valued random variables. Whatis a sharp upper bound on the probability that their sum is significantlylarger than their mean? In the case of independent random variables, afundamental tool for bounding such probabilities is devised by WassilyHoeffding. In this paper we consider analogues of Hoeffding's result for sumsof ...