Biased graph walks for RDF graph embeddings-Reference-Cited by-同舟云学术

Biased graph walks for RDF graph embeddings

Published:2017-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics
language:
Short-container-title:

Author:

Cochez Michael¹,Ristoski Petar²,Ponzetto Simone Paolo²,Paulheim Heiko²

Affiliation:

1. RWTH University Aachen, Aachen, Germany and University of Jyvaskyla, Jyvaskyla, Finland

2. University of Mannheim, Mannheim, Germany

Funder

Ministry of Science, Research and the Arts of the state of Baden-Wuremberg

German Research Foundation (DFG)

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3102254.3102279

Reference45 articles.

1. Antoine Bordes Nicolas Usunier Alberto Garcia-Duran Jason Weston and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. In Advances in neural information processing systems. 2787--2795. Antoine Bordes Nicolas Usunier Alberto Garcia-Duran Jason Weston and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. In Advances in neural information processing systems . 2787--2795.

2. The anatomy of a large-scale hypertextual Web search engine

3. Weiwei Cheng Gjergji Kasneci Thore Graepel David Stern and Ralf Herbrich. 2011. Automated Feature Generation from Structured Knowledge. In CIKM. 10.1145/2063576.2063779 Weiwei Cheng Gjergji Kasneci Thore Graepel David Stern and Ralf Herbrich. 2011. Automated Feature Generation from Structured Knowledge. In CIKM . 10.1145/2063576.2063779

4. Gerben Klaas Dirk de Vries. 2013. A Fast Approximation of the Weisfeiler-Lehman Graph Kernel for RDF Data.. In ECML/PKDD (1). 10.1007/978-3-642-40988-2_39 Gerben Klaas Dirk de Vries. 2013. A Fast Approximation of the Weisfeiler-Lehman Graph Kernel for RDF Data.. In ECML/PKDD (1) . 10.1007/978-3-642-40988-2_39

5. Gerben Klaas Dirk de Vries and Steven de Rooij. 2013. A fast and simple graph kernel for RDF. In DMLOD. Gerben Klaas Dirk de Vries and Steven de Rooij. 2013. A fast and simple graph kernel for RDF. In DMLOD .

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. TEA+ : A Novel Temporal Graph Random Walk Engine with Hybrid Storage Architecture;ACM Transactions on Architecture and Code Optimization;2024-05-21

2. The RDF2vec family of knowledge graph embedding methods;Semantic Web;2024-05-14

3. Scalable Semi-Supervised Graph Learning Techniques for Anti Money Laundering;IEEE Access;2024

4. Optimizing GPU-Based Graph Sampling and Random Walk for Efficiency and Scalability;IEEE Transactions on Computers;2023-09-01

5. TEA: A General-Purpose Temporal Graph Random Walk Engine;Proceedings of the Eighteenth European Conference on Computer Systems;2023-05-08