AUTHORS: Luis Gomez, Andres Rey, Angel Lozada
Download as PDF
ABSTRACT: In Crowdsourcing, the aggregation of results consists of introducing redundancy by asking several workers to perform the same task, and then adding the answers given by the workers seeking to obtain results that are more reliable. The aggregation of results is a very promising approach that can be easily implemented when having numerical entries, but it is quite complex when the entries correspond to strings. This article details how the concept of Median String was applied to perform the aggregation of Crowdsourcing strings, developing an evolutionary algorithm for this purpose. The results obtained show that our algorithm can calculate the Median String, which is a NP-Hard problem, of correct way but when applied to correct errors in Crowdsourcing calculating the correct answer (hidden truth) depends on the quality of the inputs that must present low dissimilarity
KEYWORDS: aggregation of results, evolutionary algorithms, median String, error correction, crowdsourcing
REFERENCES:
[
1] J. Howe, The rise of crowdsourcing, Wired
Mag., Vol 14, No.6, 2006, pp. 1–4.
[2] D. Brabham, Crowdsourcing as a model for
problem solving: leveraging the collective
intelligence of online communities for public
good. The University of Utah, 2010.
[3] A. Quinn & B.Bederson, Human computation:
a survey and taxonomy of a growing field,
Proceedings of the SIGCHI conference on
human factors in computing systems, 2011,
pp.1403–1412.
[4] L. Duan, S. Oyama, H. Sato, & M. Kurihara,
Separate or joint? Estimation of multiple labels
From crowdsourced annotations, Expert Syst.
Appl.,Vol.41, No.13, 2014, 5723–5732.
[5] S. Altschul, W. Gish, W. Miller, E. W. Myers,
& D. Lipman, Basic local alignment search
tool, J. Mol. Biol., Vol.215, No.3, 1990, pp. 403–410.
[6] D. Sankoff & J. Kruskal, Time warps, string
edits, and macromolecules: the theory and
practice of sequence comparison, Read.
Addison-Wesley Publ, 1, 1983.
[7] C. de la Higuera & F. Casacuberta, Topology of
strings: Median string is NP-complete, Theor.
Comput. Sci., Vol.230, No.1, 2000, pp.39–48.
[8] T. Kohonen, Median strings, Pattern Recognit.
Lett., Vol.3, No.5, 1985, pp. 309–313.
[9] C. Martínez-Hinarejos, La cadena media y su
aplicación en reconocimiento de formas, Phd.
Thesis. UPV, 2003.
