Skip to main content
SpringerLink
Log in

Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

The computational complexity of a new class of combinatorial optimization problems that are induced by optimal machine learning procedures in the class of collective piecewise linear classifiers of committee type is studied.

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. A. A. Borovkov, Mathematical Statistics (Nauka, Novosibirsk, 1997; Gordon & Breach, Amsterdam, 1998).

    MATH  Google Scholar 

  2. V. N. Vapnik, Statistical Learning Theory (Wiley, New York, 1998).

    MATH  Google Scholar 

  3. A. Blum and R. L. Rivest, in Advances in Neural Information Processing Systems, Ed. by D. S. Touretzky (M. Kaufmann, San Mateo, 1988), pp. 494–501.

    Google Scholar 

  4. J. H. Lin and J. S. Vitter, Machine Learning 6, 211 (1991).

    Google Scholar 

  5. M. Khachay, J. Math. Model. Algorithms 6(4), 547 (2007).

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Khachai and M. Poberii, Informatica 20(2), 217 (2009).

    MathSciNet  Google Scholar 

  7. I. Dinur, J. ACM 54(3), Paper 12 (2007).

  8. Vl. D. Mazurov, Kibernetika 3, 140 (1971).

    MathSciNet  Google Scholar 

  9. M. Khachai, V. Mazurov, and A. Rybin, Proc. Steklov Inst. Math., Suppl. 1, S67 (2002).

    MathSciNet  Google Scholar 

  10. M. Khachai, Pattern Recogn. Image Anal. 18(2), 237 (2008).

    MathSciNet  Google Scholar 

  11. N. Megiddo and A. Tamir, Oper. Res. Lett. 1(5), 194 (1982).

    Article  MATH  MathSciNet  Google Scholar 

  12. S. V. Yablonskii, Introduction to Discrete Mathematics (Nauka, Moscow, 1986) [in Russian].

    Google Scholar 

  13. D. S. Johnson and F. P. Preparata, Theor. Comput. Sci. 6, 93 (1978).

    Article  MATH  MathSciNet  Google Scholar 

  14. M. Yu. Khachai, Zh. Vychisl. Mat. Mat. Fiz. 42(10), 1609 (2002).

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi 16, Yekaterinburg, 620990, Russia

    M. Yu. Khachai

Authors
  1. M. Yu. Khachai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Yu. Khachai.

Additional information

Original Russian Text © M.Yu.Khachai, 2010, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2010, Vol. 16, No. 3.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khachai, M.Y. Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning. Proc. Steklov Inst. Math. 272 (Suppl 1), 46–54 (2011). https://doi.org/10.1134/S0081543811020040

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation