AKSW Colloquium, 09.05.2016: Hebrew MMoOn inventory, federated SPARQL query processing

In this week’s colloquium Bettina Klimek will give a practice talk of the paper ‘Creating Linked Data Morphological Language Resources with MMoOn – The Hebrew Morpheme Inventory‘, which she will present at the LREC conference 2016, 23-28 May 2016, Slovenia, Portorož.

Abstract

The development of standard models for describing general lexical resources has led to the emergence of numerous lexical datasets of various languages in the Semantic Web. However, there are no models that describe the domain of morphology in a similar manner. As a result, there are hardly any language resources of morphemic data available in RDF to date. This paper presents the creation of the Hebrew Morpheme Inventory from a manually compiled tabular dataset comprising around 52.000 entries. It is an ongoing effort of representing the lexemes, word-forms and morphologigal patterns together with their underlying relations based on the newly created Multilingual Morpheme Ontology (MMoOn). It will be shown how segmented Hebrew language data can be granularly described in a Linked Data format, thus, serving as an exemplary case for creating morpheme inventories of any inflectional language with MMoOn. The resulting dataset is described a) according to the structure of the underlying data format, b) with respect to the Hebrew language characteristic of building word-forms directly from roots, c) by exemplifying how inflectional information is realized and d) with regard to its enrichment with external links to sense resources.

 

As a second talk, Muhammad Saleem will present his thesis titled “Efficient Source Selection For SPARQL Endpoint Federation” . This thesis addresses two key areas of federated SPARQL query processing: (1) efficient source selection, and (2) comprehensive SPARQL benchmarks to test and ranked federated SPARQL engines as well as triple stores.

Posted in Colloquium, paper presentation, PHD thesis defense practise | Comments Off on AKSW Colloquium, 09.05.2016: Hebrew MMoOn inventory, federated SPARQL query processing

AKSW Colloquium, 25.04.2016, DISPONTE, Workbench for Big Data Dev

In this colloquium, Frank Nietzsche will present his master thesis titled “Game Theory- distributed solving”

Game theory analyzes the behavior of individuals in complex situations. One popular game in Europe and North America with such a complex situation is Skat. For the analysis of the game, the counterfactual regret minimization algorithm (CFR algorithm) was applied. Unfortunately, there is no guarantee that the algorithm works in three-person games. In general, it is difficult to solve three-person games. In addition, the algorithm calculates only a epsilon-Nash equilibrium. But for Skat, the Perfect Bayesian equilibrium would be a better solution. In fact, the Perfect Bayesian equilibrium is a subset of the Nash equilibrium. This raises the question of whether a Perfect Bayesian equilibrium can be calculated using the CFR algorithm. The analysis of this problem will be the last part of the presentation.

The second talk of the colloquium,  Dr. Michael Martin will  announce the student thesis on the AKSW website.

 

About the AKSW Colloquium

This event is part of a series of events about Semantic Web technology. Please see http://wiki.aksw.org/Colloquium for further information about previous and future events. As always, Bachelor and Master students are able to get points for attendance and there is complimentary coffee and cake after the session.

Posted in Uncategorized | Comments Off on AKSW Colloquium, 25.04.2016, DISPONTE, Workbench for Big Data Dev

AKSW Colloquium, 18.04.2016, DISPONTE, Workbench for Big Data Dev

In this week’s Colloquium, today 18th of April at 3 PM, Patrick Westphal will present the paper ‘Probabilistic Description Logics under the Distribution Semantics‘ by Riguzzi et. al.

Abstract

Representing uncertain information is crucial for modeling real world domains. In this paper we present a technique for the integration of probabilistic information in Description Logics (DLs) that is based on the distribution semantics for probabilistic logic programs. In the resulting approach, that we called DISPONTE, the axioms of a probabilistic knowledge base (KB) can be annotated with a real number between 0 and 1. A probabilistic knowledge base then defines a probability distribution over regular KBs called worlds and the probability of a given query can be obtained from the joint distribution of the worlds and the query by marginalization. We present the algorithm BUNDLE for computing the probability of queries from DISPONTE KBs. The algorithm exploits an underlying DL reasoner, such as Pellet, that is able to return explanations for queries. The explanations are encoded in a Binary Decision Diagram from which the probability of the query is computed. The experimentation of BUNDLE shows that it can handle probabilistic KBs of realistic size.

The second talk of the colloquium will be Spark/HDFS Big Data Workbench, which enables developers to easily setup HDFS/Spark cluster and run Spark jobs over it (presented by Ivan Ermilov).

Posted in Colloquium, major tool release, paper presentation | Comments Off on AKSW Colloquium, 18.04.2016, DISPONTE, Workbench for Big Data Dev

AKSW Colloquium, 11.04.2016, METEOR with DBnary

Depiction of Diego MoussallemIn this week’s Colloquium, today 11th of April at 3 PM, Diego Moussallem will present the paper by Zied Elloumi et al. titled “METEOR for Multiple Target Languages using DBnary.” [PDF].

Abstract

This paper proposes an extension of METEOR, a well-known MT evaluation metric, for multiple target languages using an in-house lexical resource called DBnary (an extraction from Wiktionary provided to the community as a Multilingual Lexical Linked Open Data). Today, the use of the synonymy module of METEOR is only exploited when English is the target language (use of WordNet). A synonymy module using DBnary would allow its use for the 21 languages (covered up to now) as target languages. The code of this new instance of METEOR, adapted to several target languages, is provided to the community. We also show that our DBnary augmented METEOR increases the correlation with human judgements on the WMT 2013 and 2014 metrics dataset for English-to-(French, Russian, German, Spanish) language pairs.

Posted in Colloquium | Comments Off on AKSW Colloquium, 11.04.2016, METEOR with DBnary

AKSW Colloquium, 04.04.2016, AMIE + Structured Feedback

Depiction of Lorenz BühmannIn this week’s Colloquium, today 4th of April at 3 PM, Lorenz Bühmann will present the paper by Galárraga et al. titled “AMIE: Association Rule Mining under Incomplete Evidence in Ontological Knowledge Bases.” [PDF].

Abstract

Recent advances in information extraction have led to huge knowledge bases (KBs), which capture knowledge in a machine-readable format. Inductive Logic Programming (ILP) can be used to mine logical rules from the KB. These rules can help deduce and add missing knowledge to the KB. While ILP is a mature field, mining logical rules from KBs is different in two aspects: First, current rule mining systems are easily overwhelmed by the amount of data (state-of-the art systems cannot even run on today’s KBs). Second, ILP usually requires counterexamples. KBs, however, implement the open world assumption (OWA), meaning that absent data cannot be used as counterexamples. In this paper, we develop a rule mining model that is explicitly tailored to support the OWA scenario. It is inspired by association rule mining and introduces a novel measure for confidence. Our extensive experiments show that our approach outperforms state-of-the-art approaches in terms of precision and coverage. Furthermore, our system, AMIE, mines rules orders of magnitude faster than state-of-the-art approaches.

Depiction of Natanael Arndt Subsequently Natanael Arndt will practice the presentation of his paper “Structured Feedback: A Distributed Protocol for Feedback and Patches on the Web of Data” (Natanael Arndt, Kurt Junghanns, Roy Meissner, Philipp Frischmuth, Norman Radtke, Marvin Frommhold and Michael Martin) [PDF] which is accepted for presentation at the WWW2016 workshop: Linked Data on the Web (LDOW2016) in Montréal.

Abstract

The World Wide Web is an infrastructure to publish and retrieve information through web resources. It evolved from a static Web 1.0 to a multimodal and interactive communication and information space which is used to collaboratively contribute and discuss web resources, which is better known as Web 2.0. The evolution into a Semantic Web (Web 3.0) proceeds. One of its remarkable advantages is the decentralized and interlinked data composition. Hence, in contrast to its data distribution, workflows and technologies for decentralized collaborative contribution are missing. In this paper we propose the Structured Feedback protocol as an interactive addition to the Web of Data. It offers support for users to contribute to the evolution of web resources, by providing structured data artifacts as patches for web resources, as well as simple plain text comments. Based on this approach it enables crowd-supported quality assessment and web data cleansing processes in an ad-hoc fashion most web users are familiar with.

About the AKSW Colloquium

This event is part of a series of events about Semantic Web technology. Please see http://wiki.aksw.org/Colloquium for further information about previous and future events. As always, Bachelor and Master students are able to get points for attendance and there is complimentary coffee and cake after the session.

Posted in Colloquium, LEDS, paper presentation, Papers | Comments Off on AKSW Colloquium, 04.04.2016, AMIE + Structured Feedback

International Semantic Web Community meets in Leipzig, Sept. 12-15, 2016

logo-semantics-16-blogpost

At the annual SEMANTiCS Conference, experts from academia and industry meet to discuss semantic computing, its benefits and future business implications. Since 2005, SEMANTiCS has been attracting the opinion leaders in semantic web and big data technology, ranging from information managers and software engineers, to commerce experts and business developers as well as researchers and IT architects, when it comes to defining the future of information technology.

The SEMANTiCS 2016 takes place from September 12th to 15th at the second oldest university of Germany – the Leipzig University. Leipzig University hosts several departments in particular AKSW focused on Linked Data and Semantic Web and is therefore THE European hotspot, when it comes to graph-based technologies and knowledge engineering.

You want to be a part of the SEMANTiCS Conference and are interested to get in touch with the following audiences?

  • IT professionals & IT architects
  • Software developers
  • Knowledge Management Executives
  • Innovation Executives
  • R&D Executives

Calls are open now. Industrial presentation offer a platform to reach a huge network of practicioners and users to get feedback and academic submission are published in the well-known ACM-ICPS series (deadline 21st April, 23% acceptance rate). To submit your contribution, please visit the section calls on our website. To attend the workshops, the tutorials or to enjoy the talks in one of the offered sessions, please visit our registration site.

You want to partner with SEMANTiCS 2016? Then get a sponsor package or become an exhibitor! For more details, please click here.

We are looking forward to meeting you! Come and join us in Leipzig!

To be up-to-date, stay tuned and follow us on facebook, twitter (@SemanticsConf) or visit our website for the latest news.

Posted in Announcements, Events | Comments Off on International Semantic Web Community meets in Leipzig, Sept. 12-15, 2016

AKSW takes part in BMWi-funded GEISER project

GEISER

The AKSW group is the technical lead of the recently started GEISER (from sensor data towards internet-based geospatial services) project funded by the Federal Ministry for Economic Affairs and Energy (BMWi) under grant agreement number 01MD16014E. The GEISER project will run from March 1st, 2016 to February 28th, 2019.

Many applications of cyberphysical systems rely on an integration of geospatial data and sensor data. In the engineering industry, dynamic mission planning of service technicians and locating suppliers can benefit from such integrated data. Other potential applications include intelligent parking and refueling by finding available parking spots and fuel pumps or charging spots nearby. Sensors of satellite navigation systems in cars and intelligent fuel pumps, connected charging points and industrial machinery generate terabytes of industry-relevant data every day. Combining many data sources is the most promising approach, but this is difficult. Relevant geospatial data is distributed among structured (e.g., sensors), semi-structured (e.g., OpenStreetMap) and unstructured (e.g., Twitter) data sources. Due to the significant volume and variety of data sources, innovative solutions are required for the acquisition of geospatial data, integrating them with sensor data and building intelligent services on top.

The GEISER project aims to design and implement innovative functionality for developing services for transforming, storing, integrating and processing geospatial and sensor data.Here, machine learning approaches will be applied for tasks such as computing topological relations between resources and time-efficient generation of link specifications. The resulting tools will be integrated as microservices in an open cloud-based platform. The AKSW group of Universität Leipzig particularly works on the extraction and integration of geospatial data. We will develop and evaluate scalable methods for analysing, extracting and fusing RDF from various data sources.

Our partners in this project are USU Software AG (Coordinator), Yellow Map, metaphacts GmbH, Frauenhofer IAIS and TomTom.

The project kick-off meeting will take place March, 14th in Karlsruhe at the office of USU Software AG, so stay tuned for futher project updates and follow us on aksw-blog for the latest news.

The project is funded by:

BMWi-logo_englULEi_logo

Posted in Announcements, GEISER, Projects, Uncategorized | Comments Off on AKSW takes part in BMWi-funded GEISER project

AKSW Colloquium, 21.03.2016, Quit-Store a quad store versioned with git + Distributed methods for Stochastic Gradient Descent

On the 21th of March a 3 PM, Norman Radtke will present his current work at LEDS project: the Quit-Store.

The Quit-Store is an in-memory quad store with git versioning. The store accepts SPARQL Select and Update queries. After an execution of a SPARQL Update the store will commit all changes of all named graphes. Therefor each named graphs is represented in a file containing alphabetically ordered n-quads.

Later on, at 3:30 PM, Nilesh Chakraborty will present an overview of two state-of-the-art methods for running stochastic gradient descent in a distributed setting.

The two papers are “SCOPE: Scalable Composite Optimization for Learning on Spark” by Zhao et al. and “Large-Scale Matrix Factorization with Distributed Stochastic Gradient Descent” by Gemulla et al.

About the AKSW Colloquium

This event is part of a series of events about Semantic Web technology. Please see http://wiki.aksw.org/Colloquium for further information about previous and future events. As always, Bachelor and Master students are able to get points for attendance and there is complimentary coffee and cake after the session.

Posted in Colloquium | Tagged , , , , | Comments Off on AKSW Colloquium, 21.03.2016, Quit-Store a quad store versioned with git + Distributed methods for Stochastic Gradient Descent

AKSW Colloquium, 14.03.2016, Question Answering on RDF Data Cubes + Matthias Wauer Introduction

On the 14th of March at 3 PM, Konrad Höffner will present a paper on AKSW’s CubeQA project titled “Question Answering on RDF Data Cubes“.

Abstract

Semantic Question Answering systems provide intuitive access to Linked Data by transforming natural language queries into formal queries on RDF knowledge bases. We design and implement the first Semantic Question Answering system that can process RDF Data Cubes and create a benchmark to evaluate it. The evaluation shows the feasibility of the approach, but also highlights challenges.

Later on, at 3:30 PM, our new colleague Matthias Wauer will give a short overview of two aspects of his research at Unister in the GeoKnow project, geospatial motives and bitset index extensions for Virtuoso (presented at SEMANTICS 2015 and KDIR 2015, respectively).

About the AKSW Colloquium

This event is part of a series of events about Semantic Web technology. Please see http://wiki.aksw.org/Colloquium for further information about previous and future events. As always, Bachelor and Master students are able to get points for attendance and there is complimentary coffee and cake after the session.

Posted in Colloquium, paper presentation | Tagged , , | Comments Off on AKSW Colloquium, 14.03.2016, Question Answering on RDF Data Cubes + Matthias Wauer Introduction

AKSW Colloquium, 07.03.2016, Regular Path Queries on Large Graphs

In this week’s Colloquium, today 7th of March at 3 PM, Claus Stadler will present the paper by Koschmieder et al. titled “Regular Path Queries on Large Graphs” [PDF].

Abstract

The significance of regular path queries (RPQs) on graph-like data structures has grown steadily over the past decade. RPQs are, often in restricted forms, part of graph-oriented query languages such as XQuery/XPath and SPARQL, and have applications in areas such as semantic, social, and biomedical networks. However, existing systems for evaluating RPQs are restricted either in the type of the graph (e.g., only trees), the type of regular expressions (e.g., only single steps), and/or the size of the graphs they can handle. No method has yet been developed that would be capable of efficiently evaluating general RPQs on large graphs, i.e., with millions of nodes/edges. We present a novel approach for answering RPQs on large graphs. Our method exploits the fact that not all labels in a graph are equally frequent. We devise an algorithm which decomposes an RPQ into a series of smaller RPQs using rare labels, i.e., elements of the query with few matches, as way-points. A search thereby is decomposed into a set of smaller search problems which are tackled in a bi-directional fashion, supported by a set of graph indexes. Comparison of our algorithm with two approaches following the traditional methods for tackling such problems, i.e., the usage of automata, reveals that (a) the automata-based methods are not able to handle large graphs due to the amount of memory they require, and that (b) our algorithm outperforms the automata-based approach, often by orders of magnitude. Another advantage of our algorithm is that it can be parallelized easily.

About the AKSW Colloquium

This event is part of a series of events about Semantic Web technology. Please see http://wiki.aksw.org/Colloquium for further information about previous and future events. As always, Bachelor and Master students are able to get points for attendance and there is complimentary coffee and cake after the session.

Posted in Colloquium, paper presentation | Tagged , , | Comments Off on AKSW Colloquium, 07.03.2016, Regular Path Queries on Large Graphs