[ { "@graph" : [ { "@id" : "http://purl.org/np/RAzgOSS4YGdsTkIFpxxAi6cAYeKJeBrj2u5xHRu1bGAD4", "@type" : [ "http://www.nanopub.org/nschema#Nanopublication" ], "http://www.nanopub.org/nschema#hasAssertion" : [ { "@id" : "http://purl.org/np/RAzgOSS4YGdsTkIFpxxAi6cAYeKJeBrj2u5xHRu1bGAD4#assertion" } ], "http://www.nanopub.org/nschema#hasProvenance" : [ { "@id" : "http://purl.org/np/RAzgOSS4YGdsTkIFpxxAi6cAYeKJeBrj2u5xHRu1bGAD4#provenance" } ], "http://www.nanopub.org/nschema#hasPublicationInfo" : [ { "@id" : "http://purl.org/np/RAzgOSS4YGdsTkIFpxxAi6cAYeKJeBrj2u5xHRu1bGAD4#pubinfo" } ] } ], "@id" : "http://purl.org/np/RAzgOSS4YGdsTkIFpxxAi6cAYeKJeBrj2u5xHRu1bGAD4#Head" }, { "@graph" : [ { "@id" : "http://purl.org/np/RAzgOSS4YGdsTkIFpxxAi6cAYeKJeBrj2u5xHRu1bGAD4#abstract", "@type" : [ "http://purl.org/spar/doco/Abstract", "http://purl.org/spar/doco/Paragraph" ], "http://purl.org/spar/c4o/hasContent" : [ { "@value" : "In this paper we examine the use of crowdsourcing as a means to master Linked Data quality problems that are difficult to solve automatically. We base our approach on the analysis of the most common errors encountered in Linked Data sources, and a classification of these errors according to the extent to which they are likely to be amenable to crowdsourcing. We then propose and compare different crowdsourcing approaches to identify these Linked Data quality issues, employing the DBpedia dataset as our use case: (i) a contest targeting the Linked Data expert community, and (ii) paid microtasks published on Amazon Mechanical Turk. We secondly focus on adapting the Find-Fix-Verify crowdsourcing pattern to exploit the strengths of experts and lay workers. By testing two distinct Find-Verify workflows (lay users only and experts verified by lay users) we reveal how to best combine different crowds’ complementary aptitudes in quality issue detection. The results show that a combination of the two styles of crowdsourcing is likely to achieve more efficient results than each of them used in isolation, and that human computation is a promising and affordable way to enhance the quality of Linked Data." } ] } ], "@id" : "http://purl.org/np/RAzgOSS4YGdsTkIFpxxAi6cAYeKJeBrj2u5xHRu1bGAD4#assertion" }, { "@graph" : [ { "@id" : "http://purl.org/np/RAzgOSS4YGdsTkIFpxxAi6cAYeKJeBrj2u5xHRu1bGAD4#assertion", "http://www.w3.org/ns/prov#hadPrimarySource" : [ { "@id" : "http://dx.doi.org/10.3233/SW-160239" } ], "http://www.w3.org/ns/prov#wasAttributedTo" : [ { "@id" : "https://orcid.org/0000-0003-0530-4305" } ] } ], "@id" : "http://purl.org/np/RAzgOSS4YGdsTkIFpxxAi6cAYeKJeBrj2u5xHRu1bGAD4#provenance" }, { "@graph" : [ { "@id" : "http://purl.org/np/RAzgOSS4YGdsTkIFpxxAi6cAYeKJeBrj2u5xHRu1bGAD4", "http://purl.org/dc/terms/created" : [ { "@type" : "http://www.w3.org/2001/XMLSchema#dateTime", "@value" : "2019-11-10T12:34:11+01:00" } ], "http://purl.org/pav/createdBy" : [ { "@id" : "https://orcid.org/0000-0002-7114-6459" } ] } ], "@id" : "http://purl.org/np/RAzgOSS4YGdsTkIFpxxAi6cAYeKJeBrj2u5xHRu1bGAD4#pubinfo" } ]