Parallel computations and committee constructions

DOI10.1134/S0005117907050165zbMATH Open1169.68576OpenAlexW1994890878MaRDI QIDQ2458086FDOQ2458086

Authors Vl. D. Mazurov, M. Yu. Khachaĭ 

Publication date 31 October 2007

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117907050165

zbMATH Keywords

laminated neural networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• On the calculation and approximation complexity of the minimal affine separating committee problem
• Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules
• scientific article; zbMATH DE number 2047437
• Committees of systems of linear inequalities
• scientific article; zbMATH DE number 5592483

Cites Work

• scientific article; zbMATH DE number 5158960 (Why is no real title available?)
• scientific article; zbMATH DE number 42573 (Why is no real title available?)
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Computational complexity of the minimum committee problem and related problems
• The hardness of 3-uniform hypergraph coloring

Cited In (4)

• Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms
• Committee polyhedral separability: complexity and polynomial approximation
• Computational capabilities of multilayer committee machines
• Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules

This page was built for publication: Parallel computations and committee constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458086)