Browsing Data Science Institute (Workshop Papers) by Author "Harth, Andreas"

Now showing items 1-10 of 10

    • The ExpertFinder Corpus 2007 for the Benchmarking and Development of ExpertFinding Systems 

      Hogan, Aidan; Harth, Andreas (2007)
      We provide a benchmark dataset for expert finding within the computer science domain. We show how large isolated data graphs from disparate structured data sources can be combined to form one, large, well-linked RDF graph ...

    • Fast and Scalable Pattern Mining for Media-Type Focused Crawling 

      Umbrich, Jürgen; Karnstedt, Marcel; Harth, Andreas (2009)
      Search engines targeting content other than hypertext documents require a crawler that discovers resources identifying files of certain media types. Naive crawling approaches do not guarantee a sufficient supply of new ...

    • Performing Object Consolidation on the Semantic Web Data Graph 

      Hogan, Aidan; Harth, Andreas; Decker, Stefan (2007)
      An important aspect of Semantic Web technologies is the issue of identity and uniquely identifying resources, which is essential for integrating data across sources. Currently, there is poor agreement on the use of ...

    • Podcast Pinpointer: A Multimedia Semantic Web Application 

      Hogan, Aidan; Harth, Andreas; Breslin, John (IEEE, 2005)
      In late 2004, a new method of publishing multimedia broadcasts on the Internet became popular called `Podcasting¿. Podcasting incorporates existing feed description formats, namely RSS 2.0, to ...

    • ReConRank: A Scalable Ranking Method for Semantic Web Data with Context 

      Hogan, Aidan; Harth, Andreas; Decker, Stefan (2006)
      We present an approach that adapts the well-known PageRank/HITS algorithms to Semantic Web data. Our method combines ranks from the RDF graph with ranks from the context graph, i.e. data sources and their linkage. We present ...

    • Scalable Authoritative OWL Reasoning on a Billion Triples 

      Hogan, Aidan; Harth, Andreas; Polleres, Axel (2008)
      In this paper we present a scalable algorithm for performing a subset of OWL reasoning over web data using a rule-based approach to forward-chaining; in particular, we identify the problem of ontology hijacking: new ...

    • SWSE: Answers Before Links! 

      Harth, Andreas; Hogan, Aidan; Delbru, Renaud; Umbrich, Jürgen; O'Riain, Sean; Decker, Stefan (CEUR-WS.org, 2007)
      We present a system that improves on current document- centric Web search engine technology; adopting an entity-centric perspective, we are able to integrate data from both static and live sources into a coherent, interlinked ...

    • SWSE: Objects before documents! 

      Harth, Andreas; Hogan, Aidan; Umbrich, Jürgen; Decker, Stefan (2008)
      Web search engines are immensely useful for locating documents online. However, with more and more structured data being published online, the restriction to the hyperdocument model impairs the usefulness for searching and ...

    • Towards a social provenance model for the Web 

      Harth, Andreas; Polleres, Axel; Decker, Stefan (2007)
      In this position paper we firstly present the established notion of provenance on the Semantic Web (also referred to as named graphs or contexts), and secondly argue for the benefit of adding to the pure technical notion ...

    • Weaving the Pedantic Web 

      Hogan, Aidan; Harth, Andreas; Passant, Alexandre; Decker, Stefan; Polleres, Axel (CEUR, 2010)
      Over a decade after RDF has been published as a W3C recommendation, publishing open and machine-readable content on the Web has recently received a lot more attention, including from corporate and governmental bodies; ...