Solving the classification problem using \(\varepsilon\)-nets

DOI10.1007/S10559-016-9863-9zbMath1349.62270OpenAlexW2487879937MaRDI QIDQ333577

Igor V. Malyk, M. A. Ivanchuk

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

zbMATH Keywords

classificationVC-dimension\(\varepsilon\)-netsseparation of sets

Mathematics Subject Classification ID

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

Related Items (1)

An algorithm to construct separable \(\epsilon\)-nets of two sets

Cites Work

• Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\)
• \(\epsilon\)-nets and simplex range queries
• A simple characterization of solutions sets of convex programs
• Special issue on Applied computational geometry
• A note on generalized inverses
• Comparison of the methods for classification of observations in predicting complications in critically ill patients
• Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
• A Generalization of the Glivenko-Cantelli Theorem
• Do Voters Affect or Elect Policies? Evidence from the U. S. House
• Breast Cancer Diagnosis and Prognosis Via Linear Programming
• 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
• Probability

This page was built for publication: Solving the classification problem using \(\varepsilon\)-nets