Solving the classification problem using -nets
From MaRDI portal
Publication:333577
DOI10.1007/S10559-016-9863-9zbMATH Open1349.62270OpenAlexW2487879937MaRDI QIDQ333577FDOQ333577
Authors: M. A. Ivanchuk, I. V. Malyk 
Publication date: 31 October 2016
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-016-9863-9
Recommendations
- An algorithm to construct separable \(\epsilon\)-nets of two sets
- Using \(\epsilon\)-nets for solving the classification problem
- Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\)
- The extremal separation of two sets: I. General results
- An approach to classification based on separation of sets by means of several ellipsoids
Cites Work
- Probability. Theory and examples.
- Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
- \(\epsilon\)-nets and simplex range queries
- A note on generalized inverses
- Comparison of the methods for classification of observations in predicting complications in critically ill patients
- Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\)
- Breast Cancer Diagnosis and Prognosis Via Linear Programming
- Do Voters Affect or Elect Policies? Evidence from the U. S. House
- A simple characterization of solutions sets of convex programs
- Special issue on Applied computational geometry
- A Generalization of the Glivenko-Cantelli Theorem
- Small-size ε-nets for axis-parallel rectangles and boxes
- A Characterization of Star-Shaped Sets
- Analysis of clustered recurrent event data with application to hospitalization rates among renal failure patients
Cited In (1)
This page was built for publication: Solving the classification problem using \(\varepsilon\)-nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333577)
