Statistical verification of linear classifiers

DOI10.1002/STA4.70111MaRDI QIDQ6852121zbMATH OpenFDO

Authors A. P. Zhiyanov, A. V. Shklyaev, Aleksey V. Galatenko, Vladimir V. Galatenko, A. G. Tonevitksy

Publication date 26 February 2026

Published in Stat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/STA4.70111

zbMATH Keywords

\(k\)-setshomogeneity testlinear classifierlinear separability

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• An improvement of the crossing number bound
• scientific article; zbMATH DE number 720689 (Why is no real title available?)
• scientific article; zbMATH DE number 3407703 (Why is no real title available?)
• Improved bounds for planar k-sets and related problems
• Improved bounds for the expected number of k-sets
• Improving the crossing lemma by finding more crossings in sparse graphs
• Machine learning. A probabilistic perspective
• On the expected number of k-sets
• Scikit-learn: machine learning in Python

This page was built for publication: Statistical verification of linear classifiers

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