Matches in Nanopublications for { <http://purl.org/np/RAFbO2l0GAu9sASfhaSIQZj3HfoY7ngGJORVAB_9Q8s-s#paragraph> ?p ?o ?g. }
Showing items 1 to 2 of
2
with 100 items per page.
- paragraph type Paragraph assertion.
- paragraph hasContent "The generation of microtasks in this stage is presented in Algorithm 2. This algorithm groups the triples in T obtained from the previous stage by quality issue, which enables the workers to focus on one quality issue at the time. The input of this stage is the set of triples to assess T and their mappings to quality issues φ̇(.). The parameter β specifies the number of questions to include in a single microtask. The algorithm firstly performs a pruning step (line 2) to remove certain triples. For instance, a triple t that was considered ‘correct’ in the Find stage ( φ̇(t) = ∅) is discarded, consistently with the definition of the Find-Fix-Verify pattern [3]. Also, in our implementation, the function prune discards answers whose inter-rater agreement were not higher than a certian value. The algorithm then proceeds to build microtasks such that each microtask only contains triples associated with a specific quality issue. For each answer from the previous stage, the algorithm decomposes the set of quality issues φ̇(t) of a triple t into singletons (lines 3-7). The set Q contains all the quality issues present in the set of triples T (line 8). For each quality issue q (line 9), the algorithm processes all triples associated with that quality issue (lines 11-18). The algorithm extracts human-readable information about the triples (line 12) and appends it to the microtask (line 13). In case that the number of questions in the current microtask exceeds the threshold β, a new microtask is then created. The outcome of the algorithm is a set M of microtasks to assess the quality of the triples in T according to the issues iden- tified in the Find stage ( φ̇(.))." assertion.