Beat the Machine: Challenging Humans to Find a Predictive Model's “Unknown Unknowns”
暂无分享,去创建一个
[1] Pedro M. Domingos. MetaCost: a general method for making classifiers cost-sensitive , 1999, KDD '99.
[2] Robert E. Schapire,et al. A Brief Introduction to Boosting , 1999, IJCAI.
[3] Gary M. Weiss. The Impact of Small Disjuncts on Classifier Learning , 2010, Data Mining.
[4] Patrick Henry Winston,et al. Learning structural descriptions from examples , 1970 .
[5] Charles Elkan,et al. The Foundations of Cost-Sensitive Learning , 2001, IJCAI.
[6] Foster J. Provost,et al. Inactive learning?: difficulties employing active learning in practice , 2011, SKDD.
[7] Raymond Reiter. On Closed World Data Bases , 1977, Logic and Data Bases.
[8] C. K. Chow,et al. On optimum recognition error and reject tradeoff , 1970, IEEE Trans. Inf. Theory.
[9] Gerardo Hermosillo,et al. Supervised learning from multiple experts: whom to trust when everyone lies a bit , 2009, ICML '09.
[10] Foster J. Provost,et al. Machine learning for targeted display advertising: transfer learning in action , 2013, Machine Learning.
[11] Tom Fawcett,et al. Data science for business , 2013 .
[12] Panagiotis G. Ipeirotis,et al. Beat the Machine: Challenging Workers to Find the Unknown Unknowns , 2011, Human Computation.
[13] Burr Settles,et al. Active Learning , 2012, Synthesis Lectures on Artificial Intelligence and Machine Learning.
[14] Panagiotis G. Ipeirotis,et al. Get another label? improving data quality and data mining using multiple, noisy labelers , 2008, KDD.
[15] C. K. Chow,et al. An optimum character recognition system using decision functions , 1957, IRE Trans. Electron. Comput..
[16] Kurt VanLehn,et al. Analogy Events: How Examples are Used During Problem Solving , 1998, Cogn. Sci..
[17] William A. Gale,et al. A sequential algorithm for training text classifiers , 1994, SIGIR '94.
[18] Foster J. Provost,et al. Active Sampling for Class Probability Estimation and Ranking , 2004, Machine Learning.