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 ...
SemanTex: semantic text exploration using document links implied by conceptual networks extracted from the texts
(ACMCEUR-WS.org, 2014)
Despite of advances in digital document processing, exploration of implicit relationships
within large amounts of textual resources can still be daunting. This
is partly due to the ‘black-box’ nature of most current ...
µRaptor: A DOM-based system with appetite for hCard elements
(CEUR-WS.org, 2014)
This paper describes µRaptor, a DOM-based method to extract hCard microformats from HTML pages stripped of microformat markup. µRaptor extracts DOM sub-trees, converts them into rules, and uses them to extract hCard ...
Knowledge base completion using distinct subgraph paths
(ACM, 2018-04-09)
Graph feature models facilitate efficient and interpretable predictions of missing links in knowledge bases with network structure (i.e. knowledge graphs). However, existing graph feature models-e.g. Subgraph Feature ...