Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Daniel Ruffinelli"'
Publikováno v:
EMNLP (Demos)
LibKGE ( https://github.com/uma-pi1/kge ) is an open-source PyTorch-based library for training, hyperparameter optimization, and evaluation of knowledge graph embedding models for link prediction. The key goals of LibKGE are to enable reproducible re
Publikováno v:
IJCAI
We propose an anytime bottom-up technique for learning logical rules from large knowledge graphs. We apply the learned rules to predict candidates in the context of knowledge graph completion. Our approach outperforms other rule-based approaches and
Publikováno v:
KI 2019: Advances in Artificial Intelligence ISBN: 9783030301781
KI
KI
Current research on knowledge graph completion is often concerned with latent approaches that are based on the idea to embed a knowledge graph into a low dimensional vector space. At the same time symbolic approaches have attracted less attention [13
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0bdcfcec5a080ae750b0efa6e52882a
https://doi.org/10.1007/978-3-030-30179-8_20
https://doi.org/10.1007/978-3-030-30179-8_20
Autor:
Daniel Ruffinelli, Benjamín Barán
Publikováno v:
Quantum Information Processing. 16
Several current implementations of quantum circuits rely on the linear nearest neighbor restriction, which only allows interaction between adjacent qubits. Most methods that address the process of converting a generic circuit to an equivalent circuit
Publikováno v:
Rules and Reasoning ISBN: 9783319612515
RuleML+RR
RuleML+RR
Reasoning with complex ontologies can be a resource-intensive task, which can be an obstacle, e.g., for real-time applications. Hence, weakening the constraints of soundness and/or completeness is often an approach to practical solutions. In this pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::190974c777598820b97256622577db67
https://doi.org/10.1007/978-3-319-61252-2_12
https://doi.org/10.1007/978-3-319-61252-2_12
Autor:
Daniel Ruffinelli, Benjamín Barán
Publikováno v:
CLEI
The linear nearest neighbor (LNN) restriction, present in several current implementations of 1D and 2D quantum circuits, limits the interaction of qubits to those which are adjacent to each other. While there have been several proposals to optimize t
Publikováno v:
MADOC-University of Mannheim
RepL4NLP@ACL
RepL4NLP@ACL
Knowledge graph embedding models have recently received significant attention in the literature. These models learn latent semantic representations for the entities and relations in a given knowledge base; the representations can be used to infer mis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5385da7cf53dca79105a0f30ab21edd5
https://madoc.bib.uni-mannheim.de/52546
https://madoc.bib.uni-mannheim.de/52546
Autor:
Rainer Gemulla, Daniel Ruffinelli, Christian Meilicke, Manuel Fink, Yanjie Wang, Heiner Stuckenschmidt
Publikováno v:
MADOC-University of Mannheim
Lecture Notes in Computer Science ISBN: 9783030006709
ISWC (1)
Lecture Notes in Computer Science ISBN: 9783030006709
ISWC (1)
Over the recent years, embedding methods have attracted increasing focus as a means for knowledge graph completion. Similarly, rule-based systems have been studied for this task in the past. What is missing so far is a common evaluation that includes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::792ce2991288fe4ed97f34cdb4016844
http://iswc2018.semanticweb.org/sessions/fine-grained-evaluation-of-rule-and-embedding-based-systems-for-knowledge-graph-completion/
http://iswc2018.semanticweb.org/sessions/fine-grained-evaluation-of-rule-and-embedding-based-systems-for-knowledge-graph-completion/