ACM Home Page
Please provide us with feedback. Feedback
Supervised learning from multiple experts: whom to trust when everyone lies a bit
Full text PdfPdf (805 KB)
Source ACM International Conference Proceeding Series; Vol. 382 archive
Proceedings of the 26th Annual International Conference on Machine Learning table of contents
Montreal, Quebec, Canada
Pages 889-896  
Year of Publication: 2009
ISBN:978-1-60558-516-1
Authors
Vikas C. Raykar  Siemens Healthcare, Malvern, PA
Shipeng Yu  Siemens Healthcare, Malvern, PA
Linda H. Zhao  University of Pennsylvania, Philadelphia, PA
Anna Jerebko  Siemens Healthcare, Malvern, PA
Charles Florin  Siemens Healthcare, Malvern, PA
Gerardo Hermosillo Valadez  Siemens Healthcare, Malvern, PA
Luca Bogoni  Siemens Healthcare, Malvern, PA
Linda Moy  New York University School of Medicine, New York, NY
Sponsors
: MITACS
: NSF
Microsoft Research : Microsoft Research
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 41,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1553374.1553488
What is a DOI?

ABSTRACT

We describe a probabilistic approach for supervised learning when we have multiple experts/annotators providing (possibly noisy) labels but no absolute gold standard. The proposed algorithm evaluates the different experts and also gives an estimate of the actual hidden labels. Experimental results indicate that the proposed method is superior to the commonly used majority voting baseline.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Dawid, A. P., & Skeene, A. M. (1979). Maximum likei-hood estimation of observed error-rates using the EM algorithm. Applied Statistics, 28, 20--28.
 
2
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B, 39, 1--38.
 
3
Frank, E., & Hall, M. (2001). A simple approach to ordinal classification. Lecture Notes in Computer Science, 145--156.
 
4
Hui, S. L., & Zhou, X. H. (1998). Evaluation of diagnostic tests without a gold standard. Statistical Methods in Medical Research, 7, 354--370.
 
5
 
6
7
 
8
Smyth, P. (1995). Learning with probabilistic supervision. In Computational learning theory and natural learning systems 3, 163--182. MIT Press.
 
9
Smyth, P., Fayyad, U., Burl, M., Perona, P., & Baldi, P. (1995). Inferring ground truth from subjective labelling of venus images. In Advances in neural information processing systems 7, 1085--1092.
 
10
Snow, R., O'Connor, B., Jurafsky, D., & Ng, A. (2008). Cheap and Fast - But is it Good? Evaluating Non-Expert Annotations for Natural Language Tasks. Proceedings of the Conference on Empirical Methods in Natural Language Processing (pp. 254--263).
 
11
Sorokin, A., & Forsyth, D. (2008). Utility data annotation with Amazon Mechanical Turk. Proceedings of the First IEEE Workshop on Internet Vision at CVPR 08 (pp. 1--8).

Collaborative Colleagues:
Vikas C. Raykar: colleagues
Shipeng Yu: colleagues
Linda H. Zhao: colleagues
Anna Jerebko: colleagues
Charles Florin: colleagues
Gerardo Hermosillo Valadez: colleagues
Luca Bogoni: colleagues
Linda Moy: colleagues