When a Constant Classifier is as Good as Any Linear Classifier

DOI10.1080/03610926.2010.498650MaRDI QIDQ2890111zbMATH OpenOpenAlexFDO

Authors Steven P. Ellis

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

zbMATH Keywords

classificationlogistic regressionmisclassification rate

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Artificial intelligence (68T99)

Recommendations

• Linear classifiers are nearly optimal when hidden variables have diverse effects
• scientific article; zbMATH DE number 2090277
• A constant factor approximation algorithm for a class of classification problems
• A representation theorem for linear pattern classifier training
• On optimal pairwise linear classifiers for normal distributions: The \(d\)-dimensional case
• scientific article; zbMATH DE number 2079781
• Conditions for Existence of Uniformly Consistent Classifiers

Cites work

• scientific article; zbMATH DE number 48904 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• 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
• The hardness of approximate optima in lattices, codes, and systems of linear equations

Cited in

(1)

• Linear classifiers are nearly optimal when hidden variables have diverse effects

Describes a project that uses

Uses Software

• ElemStatLearn

This page was built for publication: When a Constant Classifier is as Good as Any Linear Classifier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890111)