Thursday, February 5, 2015


Als Vorlage für die Abschlussarbeit soll folgendes Dokument dienen:

Die Latex-Vorlagen findet ihr hier (Login mit HPI credentials):

Thursday, January 29, 2015


In der nächsten Woche endet unser Seminar zu Linked Data Mashups. Bereitet bitte zu nächster Woche eine Abschlusspräsentation vor (10 min) in der ihr nochmal die von euch gewählte Aufgabe, euren Lösungsvorschlag und das finale Ergebnis präsentiert.


5.2.2015 / 9:15 Uhr
Raum H-E.52

Im Anschluss an den Vortag werden wir eine kurze Einführung zur Form der erwarteten Ausarbeitung geben. Die Deadline für die Abgabe der Ausarbeitung (via Mail) und der Software mit Dokumentation ist der 5.3.2015.

Thursday, January 22, 2015

The Fact Ranking Challenge continues...

Dear students,

we have updated our Fact Ranking Quiz with a new user interface.

Please check out our new version and help us by putting in your knowledge and point of view!

The user experience is now improved with a new look&feel, such that you are able to understand and judge the facts more easily. Also the scoring of points is much more transparent. The more feedback you provide, the more you will earn...and you will know in advance how much points your effort is worth while. However, if you are not familiar with one of the presented facts, you can always check at "I don't know".

We are committed to gathering as much input as possible, in order to draw objective conclusions about what is important about an entity. Therefore, we do really appreciate your help in this task! 

Please do also spread the word and share the task with your friends and family. The more participants, the more valid our ground truth will be. Together, we will build a first corpus that will help our scientific community in evaluating different fact ranking strategies!

Thursday, December 4, 2014

Participate in the Fact Ranking Challenge

Dear students!
We have developed a (fun) quiz which will allow us to tackle one of our main scientific research problems and we would really appreciate your participation and help in our experiment!

The problem is that, as we all know, there is too much information available on the web. How do we decide which facts are important or most relevant for a specific object?

Many fact ranking systems have already been developed, trying to solve this issue. To determine the relevance of a fact is a basic problem if you want to develop an intelligent recommender system that considers content-based relationships. However, the difficulty is that there does not exist any gold standard corpus which could serve as a ground truth for evaluating their performance.

How do you determine, which information or fact is more important or relevant than another? Just a quick example. Let's assume we have the following two facts:
(1) Albert Einstein is a physicist.
(2) Albert Einstein is a vegetarian.

Which of the two facts is more important or relevant? This is difficult to answer, simply because the truth often lies in the eye of the beholder. For a vegetarian, maybe the second fact is more important. But, what about the most common opinion? What would the mainstream think? Probably, most people would say that fact (1) in general is more important.

Our quiz can be found here. The registration takes just 1 minute and after that the task will be explained to you in detail.

We considered about 500 popular concepts from Wikipedia and you have 
(1) to think about the most important facts about these concepts that come to your mind and then 
(2) to rate the (new) facts presented to you according to their relevance. 
There is no right or wrong answer. Just vote as you think it seems right for you. Afterwards, we will aggregate all votes from all participants to determine a general (mainstream) relevance for the presented facts.

You may interrupt your rating of the presented facts at any time you like and continue later. As you go, you will get score points which depend on how well you've answered the questions and how many concepts you've covered. 

To make it more challenging, we have reserved a prize for the student that gets most points by Christmas time! The student who collects the most points will receive a copy of the book "Logicomix: An epic search for truth" in our last lecture before Christmas on Dec. 16, 2014. Logicomix is an engaging and exciting graphic novel that will walk you through the extraordinary world of logics in a witty way.
(Please register with your full name, or send us your chosen username by email, so that we can identify the most successful players.)

The task is already running for quite a while. So please don't get scared by existing highscores. The competition and the prize is only reserved to our students. 

We would really appreciate your help in this task! Please do also spread the word and share the task with your friends and family. The more participants, the more valid our ground truth will be. While you are playing this game, your inputs will contribute to our scientific experiment. Together, we will build a first corpus that will help our scientific community in evaluating different fact ranking strategies!

For more information, see: 

Thursday, November 27, 2014


Für den 18.12.2014 planen wir die Zwischenpräsentation im Seminar. Zu diesem Termin bitten wir euch, eine kurze Präsentation (15min) über euer Projekt und den Fortschritt der Arbeiten vorzubereiten. Zusätzlich solltet ihr Probleme, die ihr hattet aufzählen und diskutieren sowie eventuelle Lösungen den anderen Gruppen präsentieren.

Termin Zwischenpräsentation
Raum H-E.5.2

Friday, November 21, 2014

Data zu Linked Data

Das Material zum Tutorial von letzter Woche liegt im Materialienordner zum Seminar. Ihr findet dort die Präsentation inklusive dem OpenRefine-Tutorial sowie den Quellcode (Java und Python) für den Zugriff auf Linked Data Ressourcen mittels der APIs.

Thursday, November 13, 2014

Weiterführende Informationen zu RDF und SPARQL

Wie heute kurz im Seminar angesprochen, können Sie hier weitere Informationen zu RDF und SPARQL in Form von Vorlesungsaufzeichnungen finden, falls Sie sich noch tiefergehend damit beschäftigen wollen: