For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

The University of West London

Return to search Previous output Next output
Output 10 of 34 in the submission
Article title

BetterRelations: Collecting Association Strengths for Linked Data Triples with a Game

Type
D - Journal article
Title of journal
Search Computing - Broadening Web Search, volume LNCS 7538 of Lecture Notes in Computer Science
Article number
-
Volume number
7538
Issue number
-
First page of article
223
ISSN of journal
1611-3349
Year of publication
2012
URL
-
Number of additional authors
4
Additional information

<22> While associations in human memory have different strengths, such explicit association strengths (edge weights) are missing in Linked Data. Hence, finding good heuristics that can estimate human-like association strengths for Linked Data facts (triples) is of major interest. This book chapter provides an overview of existing approaches to rate Linked Data triples that could be valuable candidates for good heuristics. We present a web-game prototype that can help with the collection of a ground truth of edge weights for triples. We explain the game’s concept, summarize Linked Data related implementation aspects, and include a detailed evaluation of the game.

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
-
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-