When a Constant Classifier is as Good as Any Linear Classifier
From MaRDI portal
Publication:2890111
DOI10.1080/03610926.2010.498650zbMath1238.62074OpenAlexW1992258790MaRDI QIDQ2890111
Publication date: 8 June 2012
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610926.2010.498650
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
- Linear Statistical Inference and its Applications
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: When a Constant Classifier is as Good as Any Linear Classifier
