Using -nets for solving the classification problem

DOI10.1007/978-3-319-57099-0_40MaRDI QIDQ5274971zbMATH OpenOpenAlexFDO

Authors M. A. Ivanchuk, I. V. Malyk

Publication date 7 July 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-57099-0_40

zbMATH Keywords

\(\epsilon\)-netssets' separationVC-dimension

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• An algorithm to construct separable \(\epsilon\)-nets of two sets
• Solving the classification problem using -nets
• Using -nets for linear separation of two sets in a Euclidean space R^d
• Almost tight bounds for -nets
• A simple proof of optimal epsilon nets

Cites work

• -nets and simplex range queries
• A Generalization of the Glivenko-Cantelli Theorem
• Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
• Comparison of the methods for classification of observations in predicting complications in critically ill patients
• Integration and Modern Analysis
• Using -nets for linear separation of two sets in a Euclidean space R^d

Cited in

(3)

• Using -nets for linear separation of two sets in a Euclidean space R^d
• Solving the classification problem using -nets
• An algorithm to construct separable \(\epsilon\)-nets of two sets

This page was built for publication: Using \(\epsilon\)-nets for solving the classification problem

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