Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules / Khachai M. Yu. // AUTOMATION AND REMOTE CONTROL. - 2010. - V. 71, l. 3. - P. 528-539.

ISSN/EISSN:

0005-1179 / нет данных

Type:

Article

Abstract:

Two new results concerned with the computational and approximation complexities of the combinatorial optimization problems arising at learning pattern recognition in the class of committee piecewise-linear decision rule were discussed.

Author keywords:

нет данных

DOI:

10.1134/S0005117910030136

Web of Science ID:

ISI:000275952000013

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	MAR
Publisher	MAIK NAUKA/INTERPERIODICA/SPRINGER
Address	233 SPRING ST, NEW YORK, NY 10013-1578 USA
Language	English
Research-Areas	Automation \& Control Systems; Instruments \& Instrumentation
Web-of-Science-Categories	Automation \& Control Systems; Instruments \& Instrumentation
ResearcherID-Numbers	Khachay, Michael/H-3251-2013
ORCID-Numbers	Khachay, Michael/0000-0003-3555-0080
Funding-Acknowledgement	Russian Federation {[}MD-370-2008.1, NSH-2081.2008.1]; Ural and Siberian Branches of Russian Academy of Sciences; Russian Foundation for Basic Research {[}07-07-00168]
Funding-Text	This work was supported by the President of the Russian Federation, projects nos. MD-370-2008.1 and NSH-2081.2008.1, Integration Project of the Ural and Siberian Branches of Russian Academy of Sciences, and the Russian Foundation for Basic Research, project no. 07-07-00168.
Number-of-Cited-References	13
Usage-Count-Since-2013	1
Journal-ISO	Autom. Remote Control
Doc-Delivery-Number	573YB