Skip to main content
SpringerLink
Log in

Linear Classifier and Projection Onto a Polytope*

  • Published:
Cybernetics and Systems Analysis Aims and scope

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

An algorithm for constructing binary linear classifiers is considered. Objects of recognition are presented by points of an n-dimensional Euclidean space. The algorithm is based on solving the problem of projecting zero onto the convex hull of a finite number of points of Euclidean space.

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. M. I. Schlesinger and V. Hlaváč, Ten Lectures on Statistical and Structural Pattern Recognition, Springer Netherlands (2002).

  2. K. V. Vorontsov, “Mathematical methods of training on precedents (Machine learning theory).” URL: http://www.machinelearning.ru/wiki/images/6/6d/Voron-ML-1.pdf.

  3. K. Leichtweiss, Convex Sets [Russian translation], Nauka, Moscow (1985).

  4. W. B. Carver, “Systems of linear inequalities,” Ann. Math., Vol. 23, No. 2, 212–220 (1921).

    MathSciNet  MATH  Google Scholar 

  5. V. S. Charin, Linear Transformations and Convex Sets [in Russian], Vyshcha Shkola, Kyiv (1978).

  6. B. T. Polyak, An Introduction to Optimization [in Russian], Nauka, Moscow (1983).

  7. B. T. Polyak, “On the convergence rate of the penalty functions method,” Vych. Mat. Mat. Fiz., Vol. 11, No. 1, 3–11 (1971).

    MATH  Google Scholar 

  8. B. N. Kozinets, “A recurrent algorithm for separation of convex hulls of two sets,” in: V. N. Vapnik (ed.), Pattern Recognition Training Algorithms [in Russian], Sov. Radio, Moscow (1973).

  9. A. S. Nemirovskii and D. B. Yudin, Complexity of Problems and Efficiency of Optimization Methods [in Russian], Nauka, Moscow (1979).

  10. Y. P. Laptin, Y. I. Zhuravlev, and A. P. Vinogradov, “Empirical risk minimization and problems of constructing linear classifiers,” Cybern. Syst. Analysis, Vol. 47, No. 4, 640–648 (2011).

    Article  MathSciNet  Google Scholar 

  11. P. Wolfe, “Finding the nearest point in a polytope,” Math. Program., Vol. 11, No. 2, 128–149 (1976).

    Article  MathSciNet  Google Scholar 

  12. E. A. Nurminskii, “Convergence of the method of suitable affine subspaces for solving the problem on the least distance to a simplex,” Vych. Mat. Mat. Fiz., Vol. 45, Issue 11, 1996–2004 (2005).

    Google Scholar 

  13. N. G. Zhurbenko, “An algorithm of projection onto a polytope,” Teoriya Optym. Rishen’, No. 7, 125–131 (2008).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    N. G. Zhurbenko

Authors
  1. N. G. Zhurbenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. G. Zhurbenko.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, May–June, 2020, pp. 163–170.

*The study was financed by the Volkswagen Foundation (Grant No. 90 306).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhurbenko, N.G. Linear Classifier and Projection Onto a Polytope*. Cybern Syst Anal 56, 485–491 (2020). https://doi.org/10.1007/s10559-020-00264-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-020-00264-3

Keywords

Search

Navigation