Das Koldfish Projekt der Universität Koblenz hat sich als Ziel gesetzt Endbenutzer bei der Entwicklung von Applikationen gegen das Semantic Web zu unterstützen, indem es als Middleware zwischen Semantic Web und Applikation wiederkehrende Herausforderungen, wie etwa die Akquise und Verwaltung von (freien) verknüpften Daten, übernimmt. Die Kernfunktionalität ist dabei die Suche und Speicherung dieser in Form von RDF Graphen vorliegenden Linked (open) Data.
The Koldfish project is our institute's effort to improve usability of Linked Open Data. In this talk, we provide in which parts we help developers and data users. We also want to initiate a fruitful discussion on how other methods and tools of our institute could be integraded to the project as well as the development of new ideas.
We provide new insights into the area of combining abstract argumentation frameworks with probabilistic reasoning. In particular, we consider the scenario when assessments on the probabilities of a subset of the arguments is given and the probabilities of the remaining arguments have to be derived, taking both the topology of the argumentation framework and principles of probabilistic reasoning into account.
Its one of the most popular YouTube videos ever produced, having been viewed more than 840 million times. Its hard to understand why this clip is so famous and actually went viral, since nothing much happens. Two little boys, Charlie and Harry, are sitting in a chair when Charlie, the younger brother, mischievously bites Harrys finger. Theres a shriek and then a laugh. The clip is called “Charlie Bit My Finger–Again!”
We study the attention dynamics towards prominent scientists by analyzing different Web signals. In our research we demonstrate how success of the scientist is related to the success of the scientific field he is working in. We use unsupervised learning techniques to discover the attention patterns in the time series. Based on these patterns we try to predict the future success of the scientist.
We investigate the relationship between semantics for formal argumentation and measures from social networking theory. In particular, we consider using matrix exponentials, which are measures used for link prediction and recommendation in social networks, as a way to measure acceptability of arguments in abstract argumentation frameworks.
Word embeddings are mappings of words to dense, real-valued vectors. The word embeddings that were created as a by-product of training neural networks for the task of language modelling were shown to encoded certain syntactic and semantic regularities. This talk will give a quick introduction to neural networks, will explain how they can be applied to the task of language modelling, and will discuss semantic properties of word embeddings. Lastly, the goal of Lukas' thesis will be presented.
Heuristic evaluation is an informal method of usability analysis. In this presentation, a set of usability heuristics for evaluating the usability of an eye controlled interfaces has been designed .
Since an RDF store may contain data from different sources with varying levels of trustworthiness, it is important to store provenance information about the data and allow the users to request these information.
For this reason, the aim of this presentation is to present the progress of the RDF and SPARQL extension developed in my bachelor thesis.
The RDF and SPARQL extension allows storing and querying of provenance information in an RDF store.
In this talk, I will present multiple analysis methods that can be performed on network dataset collections which contain a large number of different datasets. Although network datasets (both social and otherwise) are used in a large fraction of studies in data mining and other areas, many papers base their work on only a single, or a small number of datasets.