Open AccessProceedings Article
Bayesian Classifier Combination
Hyun-Chul Kim,Zoubin Ghahramani +1 more
- 21 Mar 2012
- pp 619-627
TL;DR: Bayesian model averaging as discussed by the authors is the coherent Bayesian way of combining multiple models only under certain restrictive assumptions, which is the framework for Bayesian model combination (which differs from model averaging) in the context of classification.
read more
Abstract: Bayesian model averaging linearly mixes the probabilistic predictions of multiple models, each weighted by its posterior probability. This is the coherent Bayesian way of combining multiple models only under certain restrictive assumptions, which we outline. We explore a general framework for Bayesian model combination (which differs from model averaging) in the context of classification. This framework explicitly models the relationship between each model’s output and the unknown true label. The framework does not require that the models be probabilistic (they can even be human assessors), that they share prior information or receive the same training data, or that they be independent in their errors. Finally, the Bayesian combiner does not need to believe any of the models is in fact correct. We test several variants of this classifier combination procedure starting from a classic statistical model proposed by Dawid and Skene (1979) and using MCMC to add more complex but important features to the model. Comparisons on several data sets to simpler methods like majority voting show that the Bayesian methods not only perform well but result in interpretable diagnostics on the data points and the models.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Truth inference in crowdsourcing: is the problem solved?
Yudian Zheng,Guoliang Li,Yuanbing Li,Caihua Shan,Reynold Cheng +4 more
- 01 Jan 2017
TL;DR: It is believed that the truth inference problem is not fully solved, and the limitations of existing algorithms are identified and point out promising research directions.
Community-based bayesian aggregation models for crowdsourcing
Matteo Venanzi,John Guiver,Gabriella Kazai,Pushmeet Kohli,Milad Shokouhi +4 more
- 07 Apr 2014
TL;DR: A novel community-based Bayesian label aggregation model, CommunityBCC, which assumes that crowd workers conform to a few different types, where each type represents a group of workers with similar confusion matrices, and consistently outperforms state-of-the-art label aggregation methods.
SURF: improving classifiers in production by learning from busy and noisy end users
Joshua Lockhart,Samuel Assefa,Ayham Alajdad,Andrew Alexander,Tucker Balch,Manuela Veloso +5 more
- 15 Oct 2020
TL;DR: In this article, the authors show that conventional crowdsourcing algorithms struggle in this user feedback setting, and present a new algorithm, SURF, that can cope with this nonresponse ambiguity.
290
The Future of Human-AI Collaboration: A Taxonomy of Design Knowledge for Hybrid Intelligence Systems
Dominik Dellermann,Adrian Calma,Nikolaus Lipusch,Thorsten Weber,Sascha Weigel,Philipp Ebel +5 more
- 08 Jan 2019
TL;DR: The need for developing socio-technological ensembles of humans and machines to accomplish complex goals by combining human and artificial intelligence to collectively achieve superior results and continuously improve by learning from each other is identified.
221
•Journal Article
Making Better Use of the Crowd: How Crowdsourcing Can Advance Machine Learning Research
TL;DR: This research, which explores the prevalence of dishonesty among crowdworkers, how workers respond to both monetary incentives and intrinsic forms of motivation, and how crowdworkers interact with each other, has immediate implications that are distill into best practices that researchers should follow when using crowdsourcing in their own research.
References
Random Forests
Leo Breiman
- 01 Oct 2001
TL;DR: Internal estimates monitor error, strength, and correlation and these are used to show the response to increasing the number of features used in the forest, and are also applicable to regression.
Bagging predictors
Leo Breiman
- 01 Aug 1996
TL;DR: Tests on real and simulated data sets using classification and regression trees and subset selection in linear regression show that bagging can give substantial gains in accuracy.
•Proceedings Article
Experiments with a new boosting algorithm
Yoav Freund,Robert E. Schapire +1 more
- 03 Jul 1996
TL;DR: This paper describes experiments carried out to assess how well AdaBoost with and without pseudo-loss, performs on real learning problems and compared boosting to Breiman's "bagging" method when used to aggregate various classifiers.
Ensemble Methods in Machine Learning
Thomas G. Dietterich
- 21 Jun 2000
TL;DR: Some previous studies comparing ensemble methods are reviewed, and some new experiments are presented to uncover the reasons that Adaboost does not overfit rapidly.