The following pages link to Jan Ramon (Q199236):
Displaying 36 items.
- A lower bound on the probability that a binomial random variable is exceeding its mean (Q334068) (← links)
- All normalized anti-monotonic overlap graph measures are bounded (Q408673) (← links)
- Effective feature construction by maximum common subgraph sampling (Q413859) (← links)
- Hölder-type inequalities and their applications to concentration and correlation bounds (Q505059) (← links)
- Compact representation of knowledge bases in inductive logic programming (Q702532) (← links)
- Learning relational dependency networks in hybrid domains (Q747248) (← links)
- Learning directed probabilistic logical models: Ordering-search versus structure-search (Q841635) (← links)
- Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
- Generalized ordering-search for learning directed probabilistic logical models (Q1009243) (← links)
- Hoeffding's inequality for sums of dependent random variables (Q1693395) (← links)
- Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model (Q1741393) (← links)
- A comparison of pruning criteria for probability trees (Q1959552) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
- Graph kernels and Gaussian processes for relational reinforcement learning (Q2433177) (← links)
- An efficiently computable subgraph pattern support measure: counting independent observations (Q2435700) (← links)
- Nearly exact mining of frequent trees in large networks (Q2435702) (← links)
- Mine ’Em All: A Note on Mining All Graphs (Q2827475) (← links)
- (Q2880911) (← links)
- (Q4413496) (← links)
- (Q4533346) (← links)
- (Q4536686) (← links)
- (Q4537964) (← links)
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with<i>IDP3</i> (Q4593015) (← links)
- (Q4645674) (← links)
- (Q4797054) (← links)
- On the Bernstein-Hoeffding method (Q4972049) (← links)
- Inductive Logic Programming (Q5394642) (← links)
- (Q5398039) (← links)
- Learning Directed Probabilistic Logical Models Using Ordering-Search (Q5452073) (← links)
- Inductive Logic Programming (Q5897180) (← links)
- A polynomial time computable metric between points sets (Q5941750) (← links)
- An accurate, scalable and verifiable protocol for federated differentially private averaging (Q6097108) (← links)
- Limits of multi-relational graphs (Q6097146) (← links)
- Linear Programs with Conjunctive Database Queries (Q6151558) (← links)
- Linear programs with conjunctive queries (Q6491014) (← links)
- Linear programs with conjunctive queries (Q6492711) (← links)