Solving the classification problem using -nets
From MaRDI portal
Publication:333577
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
- A Characterization of Star-Shaped Sets
- A Generalization of the Glivenko-Cantelli Theorem
- A note on generalized inverses
- A simple characterization of solutions sets of convex programs
- Analysis of clustered recurrent event data with application to hospitalization rates among renal failure patients
- Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
- Breast Cancer Diagnosis and Prognosis Via Linear Programming
- Comparison of the methods for classification of observations in predicting complications in critically ill patients
- Do Voters Affect or Elect Policies? Evidence from the U. S. House
- Probability. Theory and examples.
- Small-size ε-nets for axis-parallel rectangles and boxes
- Special issue on Applied computational geometry
- Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\)
- \(\epsilon\)-nets and simplex range queries
Cited in
(4)
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)