LGMLMay 1, 2018

Decision Tree Design for Classification in Crowdsourcing Systems

arXiv:1805.00559v110 citations
Originality Incremental advance
AI Analysis

This work addresses classification accuracy and cost efficiency in crowdsourcing, but it appears incremental as it builds on existing decision tree methods for unreliable data.

The paper tackles the problem of classification in crowdsourcing systems by designing decision trees to minimize misclassification probability, considering unreliable workers with errors, and proposes algorithms and worker assignment strategies to balance cost and error performance.

In this paper, we present a novel sequential paradigm for classification in crowdsourcing systems. Considering that workers are unreliable and they perform the tests with errors, we study the construction of decision trees so as to minimize the probability of mis-classification. By exploiting the connection between probability of mis-classification and entropy at each level of the decision tree, we propose two algorithms for decision tree design. Furthermore, the worker assignment problem is studied when workers can be assigned to different tests of the decision tree to provide a trade-off between classification cost and resulting error performance. Numerical results are presented for illustration.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes