Ivanchuk M.A., Malyk I.V.
An algorithm to construct separable ε-nets of two sets

The authors propose a new method to solve classification problem based on separation of two sets in space Rd. The necessary and sufficient conditions of ε-separability are proved. The algorithm of constructing two separable ε-nets of size [2d / ε] is proposed. The paper contains an example of applying this algorithm to two sets generated from normally distributed sets. The classification results for the proposed method and for support vector machines are compared. © 2016, Springer Science+Business Media New York.

Keywords: separating plane, separation of sets, VC-dimension, ε-nets, Normal distribution, Classification results, Problem-based, separating plane, Separation of sets, VC dimension, Separation

Cite:
Ivanchuk M.A., Malyk I.V. (2016). An algorithm to construct separable ε-nets of two sets. Cybernetics and Systems Analysis, 52 (6), 127-134. doi: https://doi.org/10.1007/s10559-016-9896-0 http://jnas.nbuv.gov.ua/article/UJRN-0000582982 [In Russian].