Search
Now showing items 21-26 of 26
The finite implication problem for expressive XML keys: Foundations, applications, and performance evaluation
(Springer, 2013)
The increasing popularity of XML for persistent data storage, processing and exchange has triggered the demand for efficient algorithms to manage XML data. Both industry and academia have long since recognized the importance ...
DRETa: extracting RDF from wikitables
(CEUR-WS.org, 2013)
Tables are widely used in Wikipedia articles to display relational information - they are inherently concise and information rich. However, aside from info-boxe s, there are no automatic methods to exploit the integrated ...
µ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 ...
SPORTAL: Searching for Public SPARQL Endpoints
(NUI Galway, 2016-10)
There are hundreds of SPARQL endpoints on the Web, but finding an endpoint relevant to a client s needs is difficult: each endpoint acts like a black box, often without a description of its content. Herein
we briefly ...
Enabling case-based reasoning on the web of data
(2010-07-20)
While Case-based reasoning (CBR) has successfully been deployed on the Web, its data models are typically inconsistent with existing information infrastructure and standards. In this paper, we examine how CBR can operate ...
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 ...