Using -nets for linear separation of two sets in a Euclidean space R^d

DOI10.1007/S10559-015-9789-7zbMATH Open1333.62164OpenAlexW2339949447MaRDI QIDQ269155FDOQ269155

Authors: M. A. Ivanchuk, I. 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

Recommendations

• An algorithm to construct separable \(\epsilon\)-nets of two sets
• Solving the classification problem using \(\varepsilon\)-nets
• A linear separability criterion for sets of Euclidean space
• Using \(\epsilon\)-nets for solving the classification problem
• Theorems on the existence of separating surfaces

zbMATH Keywords

\(\varepsilon\)-netset separabilityVapnik-Chervonenkis dimension

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• \(\epsilon\)-nets and simplex range queries
• Comparison of the methods for classification of observations in predicting complications in critically ill patients
• Core vector machines: fast SVM training on very large data sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Linear-integer separation of binary patterns by linear programming
• Solving the classification problem using \(\varepsilon\)-nets
• Using \(\epsilon\)-nets for solving the classification problem
• A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application
• An algorithm to construct separable \(\epsilon\)-nets of two sets

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

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