Skip to main content
SpringerLink
Log in

Strict Polynomial Separation of Two Sets

  • Mathematics
  • Published:
Vestnik St. Petersburg University, Mathematics Aims and scope Submit manuscript

Abstract

One of the main tasks of mathematical diagnostics is the strict separation of two finite sets in a Euclidean space. Strict linear separation is widely known and reduced to the solution of a linear programming problem. We introduce the notion of strict polynomial separation and show that the strict polynomial separation of two sets can be also reduced to the solution of a linear programming problem. The objective function of the linear programming problem proposed in this paper has the following feature: its optimal value can be only zero or one, i.e., it is zero if the sets admit strict polynomial separation and one otherwise. Some illustrative examples of the strict separation of two sets on a plane with the use of fourth degree algebraic polynomials in two variables are given. The application efficiency of strict polynomial separation to binary data classification problems is analyzed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. P. Bennett and O. L. Mangasarian, “Robust linear programming discrimination of two linearly inseparable sets,” Optim. Methods Software 1, 23–34 (1992).

    Article  Google Scholar 

  2. M. K. Gavurin and V. N. Malozemov, Extremal Problems with Linear Constraints (Leningr. Gos. Univ., Leningrad, 1984) [in Russian].

    MATH  Google Scholar 

  3. T. Hastie, R. Tibshirani, and J. H. Friedman, The Elements of Statistical Learning: Data Mining, Inference, and Prediction (Springer-Verlag, New York, 2009).

    Book  MATH  Google Scholar 

  4. D. Dua and E. Karra Taniskidou, UCI Machine Learning Repository (Irvine, CA, University of California, School of Information and Computer Science). http://archive.ics.uci.edu/ml. Accessed December 20, 2018.

  5. C. Chih-Chung and L. Chih-Jen, “LIBSVM: A library for support vector machines,” ACM Trans. Intell. Syst. Technol. 2, 27:1–27:27 (2011). Software available at http://www.csie.ntu.edu.tw/cjlin/libsvm. Accessed December 20, 2018.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St. Petersburg State University, St. Petersburg, 199034, Russia

    V. N. Malozemov & A. V. Plotkin

Authors
  1. V. N. Malozemov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Plotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to V. N. Malozemov or A. V. Plotkin.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Malozemov, V.N., Plotkin, A.V. Strict Polynomial Separation of Two Sets. Vestnik St.Petersb. Univ.Math. 52, 162–168 (2019). https://doi.org/10.1134/S1063454119020109

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1063454119020109

Keywords

Search

Navigation