Fetching the paper…
Reading the bibliography…
A binary classifier capable of abstaining from making a label prediction has two goals in tension: minimizing errors, and avoiding abstaining unnecessarily often.
An optimum character recognition system using decision functions
C K Chow · 1957
Earlier work this paper cites.
On optimum recognition error and reject tradeoff
C. Chow · 1970
Earlier work this paper cites.
Estimation of dependences based on empirical data
Vladimir Naumovich Vapnik · 1982
Earlier work this paper cites.
Generalized linear models
Peter McCullagh and John A Nelder · 1989
Earlier work this paper cites.
The error-reject tradeoff
Lars Kai Hansen, Christian Liisberg, and Peter Salamon · 1997
Earlier work this paper cites.
An optimal reject rule for binary classifiers
Francesco Tortorella · 2000
Earlier work this paper cites.
Support vector machine active learning with applications to text classification
Simon Tong and Daphne Koller · 2002
Earlier work this paper cites.
Generalization bounds for averaged classifiers
Yoav Freund, Yishay Mansour, and Robert E Schapire · 2004
Earlier work this paper cites.
Prediction, Learning, and Games
Nicolo Cesa-Bianchi and Gàbor Lugosi · 2006
Earlier work this paper cites.
The interaction between classification and reject performance for distance-based reject-option classifiers
Thomas CW Landgrebe, David MJ Tax, Pavel Paclík, and Robert PW Duin · 2006
Earlier work this paper cites.
Classification with a reject option using a hinge loss
Peter L Bartlett and Marten H Wegkamp · 2008
Cited alongside, same era.
Pareto-based multiobjective machine learning: An overview and case studies
Yaochu Jin and Bernhard Sendhoff · 2008
Cited alongside, same era.
Knows what it knows: a framework for self-aware learning
Lihong Li, Michael L Littman, and Thomas J Walsh · 2008
Cited alongside, same era.
Combining classifiers for improved classification of proteins from sequence or structure
Iain Melvin, Jason Weston, Christina S Leslie, and William S Noble · 2008
Cited alongside, same era.
Support vector machines with a reject option
Yves Grandvalet, Alain Rakotomamonjy, Joseph Keshet, and Stéphane Canu · 2009
Cited alongside, same era.
On the foundations of noise-free selective classification
Ran El-Yaniv and Yair Wiener · 2010
Agnostic selective classification
Ran El-Yaniv and Yair Wiener · 2011
Later among the works it cites.
Support vector machines with a reject option
Marten Wegkamp and Ming Yuan · 2011
Later among the works it cites.
Boosting: Foundations and Algorithms
Robert E. Schapire and Yoav Freund · 2012
Later among the works it cites.
Supervised sequential classification under budget constraints
Kirill Trapeznikov and Venkatesh Saligrama · 2013
Later among the works it cites.
Beyond disagreement-based agnostic active learning
Chicheng Zhang and Kamalika Chaudhuri · 2014
Later among the works it cites.
Optimally combining classifiers using unlabeled data
Akshay Balsubramani and Yoav Freund · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Composite binary losses
Mark D Reid and Robert C Williamson · 2010
Cited alongside, same era.
Classification methods with reject option based on convex risk minimization
Ming Yuan and Marten Wegkamp · 2010
Cited alongside, same era.
Libsvm: a library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Cited alongside, same era.
Scalable semi-supervised classifier aggregation
Akshay Balsubramani and Yoav Freund · 2015
Later among the works it cites.
Optimal binary classifier aggregation for general losses
Akshay Balsubramani and Yoav Freund · 2016
Closest in time.
Learning with rejection
Corinna Cortes, Giulia DeSalvo, and Mehryar Mohri · 2016
Closest in time.