Trudy Instituta Matematiki i Mekhaniki UrO RAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2010, Volume 16, Number 3, Pages 276–284 (Mi timm599)  
This article is cited in 2 scientific papers (total in 2 papers)

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

M. Yu. Khachai

Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
Full-text PDF (182 kB) Citations (2)
References:
PDF
HTML
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.
Keywords: empirical risk minimization, committee decision rule, computational complexity.
Received: 02.04.2010
English version:
Proceedings of the Steklov Institute of Mathematics (Supplementary issues), 2011, Volume 272, Issue 1, Pages S46–S54
DOI: https://doi.org/10.1134/S0081543811020040
Bibliographic databases:
Document Type: Article
UDC: 519.6
Language: Russian
Citation: M. Yu. Khachai, “Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning”, Trudy Inst. Mat. i Mekh. UrO RAN, 16, no. 3, 2010, 276–284; Proc. Steklov Inst. Math. (Suppl.), 272, suppl. 1 (2011), S46–S54
Citation in format AMSBIB
\Bibitem{Kha10}
\by M.~Yu.~Khachai
\paper Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2010
\vol 16
\issue 3
\pages 276--284
\mathnet{http://mi.mathnet.ru/timm599}
\elib{https://elibrary.ru/item.asp?id=15173487}
\transl
\jour Proc. Steklov Inst. Math. (Suppl.)
\yr 2011
\vol 272
\issue , suppl. 1
\pages S46--S54
\crossref{https://doi.org/10.1134/S0081543811020040}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000289527400004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-79954617326}
Linking options:
  • https://www.mathnet.ru/eng/timm599
  • https://www.mathnet.ru/eng/timm/v16/i3/p276
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Trudy Instituta Matematiki i Mekhaniki UrO RAN
    Statistics & downloads:
    Abstract page:281
    Full-text PDF :80
    References:54
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024