Average-Case Active Learning with Costs
暂无分享,去创建一个
[1] Teresa M. Przytycka,et al. On an Optimal Split Tree Problem , 1999, WADS.
[2] Steve Hanneke,et al. Teaching Dimension and the Complexity of Active Learning , 2007, COLT.
[3] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[4] Yogish Sabharwal,et al. Approximating Decision Trees with Multiway Branches , 2009, ICALP.
[5] Mark Craven,et al. Active Learning with Real Annotation Costs , 2008 .
[6] Micah Adler,et al. Approximating Optimal Binary Decision Trees , 2008, APPROX-RANDOM.
[7] Steve Hanneke. The Cost Complexity of Interactive Learning , 2006 .
[8] Sanjoy Dasgupta,et al. Analysis of a greedy active learning strategy , 2004, NIPS.
[9] Sanjoy Dasgupta,et al. A General Agnostic Active Learning Algorithm , 2007, ISAIM.
[10] John Langford,et al. Importance weighted active learning , 2008, ICML '09.
[11] Mukesh K. Mohania,et al. Decision trees for entity identification: approximation algorithms and hardness results , 2007, PODS '07.