Relational retrieval using a combination of path-constrained random walks
From MaRDI portal
Publication:1959608
DOI10.1007/s10994-010-5205-8zbMath1470.68130OpenAlexW2029249040MaRDI QIDQ1959608
Publication date: 7 October 2010
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-010-5205-8
Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20) Random walks on graphs (05C81)
Related Items (13)
Unnamed Item ⋮ Knowledge graphs completion via probabilistic reasoning ⋮ HiAM: a hierarchical attention based model for knowledge graph multi-hop reasoning ⋮ DAPath: distance-aware knowledge graph reasoning based on deep reinforcement learning ⋮ Efficient inference and learning in a large knowledge base. Reasoning with extracted information using a locally groundable first-order probabilistic logic ⋮ Knowledge graph embedding by logical-default attention graph convolution neural network for link prediction ⋮ Non-parametric learning of embeddings for relational data using Gaifman locality theorem ⋮ kLog: a language for logical and relational learning with kernels ⋮ Learning to Rank in Entity Relationship Graphs ⋮ Finding relational redescriptions ⋮ Measuring diversity in heterogeneous information networks ⋮ Unsupervised meta-path selection for text similarity measure based on heterogeneous information networks ⋮ Non-parametric learning of lifted restricted Boltzmann machines
Cites Work
This page was built for publication: Relational retrieval using a combination of path-constrained random walks
