Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model
DOI10.1007/s10618-018-0553-2zbMath1411.68134OpenAlexW2791684054WikidataQ114827249 ScholiaQ114827249MaRDI QIDQ1741393
Jan Ramon, Irma Ravkic, Martin Žnidaršič, Jesse Davis
Publication date: 3 May 2019
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/617048
Estimation in multivariate analysis (62H12) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Graph algorithms (graph-theoretic aspects) (05C85)
Uses Software
Cites Work
- Unnamed Item
- Learning relational dependency networks in hybrid domains
- Complete mining of frequent patterns from graphs: Mining graph data
- Markov logic networks
- Emergence of Scaling in Random Networks
- An Algorithm for Subgraph Isomorphism
- Inductive Logic Programming
- Computing and Combinatorics
- Approximately Counting Embeddings into Random Graphs
This page was built for publication: Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model
