Using $$\epsilon $$ -nets for Solving the Classification Problem

DOI10.1007/978-3-319-57099-0_40zbMath1369.62137OpenAlexW2605378268MaRDI QIDQ5274971

M. A. Ivanchuk, Igor 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

VC-dimension\(\epsilon\)-netssets' separation

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Using $$\epsilon $$ -nets for Solving the Classification Problem