[public-lod2] Can we create better links by playing games?

Michael Hopwood michael at editeur.org
Wed Jun 20 08:03:40 UTC 2012

Hello Jens,

I'm sad to say I couldn't get the game going because it froze before I could answer my first question.

What this game is talking about, though, is something that libraries, museums and archives have been doing for a long time, and are still doing (although now there's much more outsourcing due to the fact that cataloguing and classification are perceived as high-cost, low return activities compared with full-text search of various kinds).

Librarians consider these activities essential, not necessarily tedious...!

The way this would be done in practice would not just be to check one source against one (almost randomly-selected) "expert" but to "triangulate" by comparing the questionable source (e.g. DBPedia) with a known, trusted source (e.g. CIA World Factbook) and then having the "expert" decide on each match's plausibility...

This is the reason libraries have reference departments, with lists and updates about standard reference sources, and huge amounts of resource invested in creating and maintaining authority files on basic data (e.g. VIAF, which is now integrated into ISNI).

Until we combine link validation with a notion of authority and trust, this approach is not going to be scalable (or useful to commercial applications). See also the VMF documentation on the need for mutually-agreed mappings between schemas (http://www.doi.org/VMF/documents/VocabularyMappingFrameworkIntroductionV1.0%28091212%29.pdf).

Best wishes,


-----Original Message-----
From: lod2-bounces at lists.okfn.org [mailto:lod2-bounces at lists.okfn.org] On Behalf Of Jens Lehmann
Sent: 19 June 2012 20:02
To: lod2 at lists.okfn.org
Subject: [public-lod2] Can we create better links by playing games?

Dear all,

most of you will agree that links are an important element of the Web of Data. There exist a number of tools, such as LIMES [1] or SILK [2], which are able to create a high number of such links by using heuristics. The manual validation of verification of such links can be quite tedious, so we try to find out whether game based approaches can be used to make that task much more interesting. We developed the VeriLinks game prototype and ask for your help to judge how well the the validation works by playing the game and answering a few questions in a

Game: http://verilinks.aksw.org
Survey: http://surveys.aksw.org/survey/verilinks

The survey itself takes only 5 minutes to complete. In addition to having the chance to play a game at work ;), there are also great prizes to win. 10 randomly selected participants will receive Amazon vouchers:

1st prize: 200 Euro
2nd prize: 100 Euro
3rd prize: 50 Euro
4th - 10th prize: 25 Euro

If you want to win a prize, please participate in the survey until this *Friday, June 22, 23:59 CET*.

Kind regards,

Quan Nguyen and Jens Lehmann
(researchers at the AKSW [3] Group, supported by LOD2 [4] and LATC [5])

[1] http://limes.sf.net
[2] http://www4.wiwiss.fu-berlin.de/bizer/silk/
[3] http://aksw.org
[4] http://lod2.eu
[5] http://latc-project.eu

Dr. Jens Lehmann
Head of AKSW/MOLE group, University of Leipzig
Homepage: http://www.jens-lehmann.org
GPG Key: http://jens-lehmann.org/jens_lehmann.asc

lod2 mailing list
lod2 at lists.okfn.org

More information about the lod2 mailing list