Non-parametric learning of embeddings for relational data using Gaifman locality theorem

DOI10.1007/978-3-030-97454-1_7zbMATH Open1524.68270OpenAlexW4213414043MaRDI QIDQ6166549FDOQ6166549

Authors: Devendra Singh Dhami, Siwen Yan, Gautam Kunapuli, Sriraam Natarajan 

Publication date: 3 August 2023

Published in: Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-97454-1_7

Recommendations

• scientific article; zbMATH DE number 2033142
• Towards nonmonotonic relational learning from knowledge graphs
• scientific article; zbMATH DE number 2089450
• Locality pursuit embedding
• scientific article; zbMATH DE number 1943824
• Localization in 1D non-parametric latent space models from pairwise affinities
• Fast learning of relational kernels

zbMATH Keywords

embeddingsstatistical relational learningGaifman locality theoremrelational density estimation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Gradient-based boosting for statistical relational learning: the relational dependency network case
• Top-down induction of first-order logical decision trees
• Relational retrieval using a combination of path-constrained random walks
• Gradient-based boosting for statistical relational learning: the Markov logic network and missing data cases
• Statistical relational artificial intelligence: logic, probability, and computation
• Relational restricted Boltzmann machines: a probabilistic logic learning approach
• Knowledge graph completion via complex tensor factorization

This page was built for publication: Non-parametric learning of embeddings for relational data using Gaifman locality theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166549)