In the paper we present a simple algorithm for unsupervised classification of given items by a group of agents. The purpose of the algorithm is to provide fast and computationally light solutions of classification tasks by the randomly chosen agents. The algorithm follows basic techniques of plurality voting and combinatorial stable matching and does not use additional assumptions or information about the levels of the agents’ expertise. Performance of the suggested algorithm is illustrated by its application to simulated and real-world datasets, and it was demonstrated that the algorithm provides close to correct classifications. The obtained solutions can be used both separately and as initial classifications in more complicated algorithms.
L. Duan, S. Oyama, H. Sato, and M. Kurihara, Separate or joint? Estimation of multiple labels from crowdsourced annotations, Expert Systems with Applications, vol. 41, no. 13, pp. 5723–5732, 2014.
C. -M. Chiu, T. -P. Liang, and E. Turban, What can crowdsourcing do for decision support, Decision Support Systems, vol. 65, pp. 40–49, 2014.
V. C. Raykar, S. Yu, L. H. Zhao, G. H. Valadez, C. Florin, and L. Moy, Learning from crowds, J. Machine Learning Research, vol. 11, pp. 1297–1322, 2010.
A. P. Dawid and A. M. Skene, Maximum likelihood estimation of observer error-rates using the EM algorithm, J. Royal Stat. Soc. Series C, vol. 28, no. 1, pp. 20–28, 1979.
D. Gale and L. S. Shapley, College admissions and the stability of marriage, American Mathematical Monthly, vol. 120, no. 5, pp. 386–391, 2013.
The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).