An algorithm to construct separable -nets of two sets

DOI10.1007/S10559-016-9896-0zbMATH Open1359.62247OpenAlexW2556407789MaRDI QIDQ508581FDOQ508581

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

Recommendations

• Solving the classification problem using \(\varepsilon\)-nets
• Using \(\epsilon\)-nets for solving the classification problem
• Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb 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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• \(\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
• Solving the classification problem using \(\varepsilon\)-nets
• Title not available (Why is that?)

Cited In (2)

• Gauge groups and data classification.
• Construction of \(\epsilon\)-nets

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)