An algorithm to construct separable -nets of two sets

DOI10.1007/S10559-016-9896-0MaRDI QIDQ508581zbMATH OpenOpenAlexFDO

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

Publication date 7 February 2017

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

Full work available at URL https://doi.org/10.1007/s10559-016-9896-0

zbMATH Keywords

separation of setsVC-dimension\(\epsilon\)-netsseparating plane

Mathematics Subject Classification ID

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

Recommendations

• Solving the classification problem using -nets
• Using \(\epsilon\)-nets for solving the classification problem
• Using -nets for linear separation of two sets in a Euclidean space R^d
• An approach to classification based on separation of sets by means of several ellipsoids
• The extremal separation of two sets: I. General results

Cites work

• scientific article; zbMATH DE number 3362869 (Why is no real title available?)
• 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
• Solving the classification problem using -nets
• -nets and simplex range queries

Cited in

(5)

• Using -nets for linear separation of two sets in a Euclidean space R^d
• Gauge groups and data classification.
• Solving the classification problem using -nets
• Construction of \(\epsilon\)-nets
• Using \(\epsilon\)-nets for solving the classification problem

This page was built for publication: An algorithm to construct separable \(\epsilon\)-nets of two sets

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