Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\)

DOI10.1007/S10559-015-9789-7zbMath1333.62164OpenAlexW2339949447MaRDI QIDQ269155

M. A. Ivanchuk, Igor V. Malyk

Publication date: 18 April 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-015-9789-7

zbMATH Keywords

Vapnik-Chervonenkis dimension\(\varepsilon\)-netset separability

Mathematics Subject Classification ID

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

Related Items (2)

Solving the classification problem using \(\varepsilon\)-nets ⋮ Using $$\epsilon $$ -nets for Solving the Classification Problem

Cites Work

• \(\epsilon\)-nets and simplex range queries
• Comparison of the methods for classification of observations in predicting complications in critically ill patients
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\)