Search
Now showing items 1-4 of 4
Identifying equivalent relation paths in knowledge graphs
(Springer Verlag, 2017-06-19)
Relation paths are sequences of relations with inverse that allow for complete exploration of knowledge graphs in a two-way unconstrained manner. They are powerful enough to encode complex relationships between entities ...
Regularizing knowledge graph embeddings via equivalence and inversion axioms
(Springer Verlag, 2017-12-30)
Learning embeddings of entities and relations using neural architectures is an effective method of performing statistical learning on large-scale relational data, such as knowledge graphs. In this paper, we consider the ...
Mining cardinalities from knowledge bases
(Springer Verlag, 2017-08-01)
Cardinality is an important structural aspect of data that has not received enough attention in the context of RDF knowledge bases (KBs). Information about cardinalities can be useful for data users and knowledge engineers ...
Using drug similarities for discovery of possible adverse reactions
(AMIA, 2017-02-10)
We propose a new computational method for discovery of possible adverse drug reactions. The method consists of two key steps. First we use openly available resources to semi-automatically compile a consolidated data set ...