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

DOI10.1134/S0081543811020040zbMath1233.90241OpenAlexW2075512162MaRDI QIDQ643804

Mikhail Yu. Khachay

Publication date: 2 November 2011

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityempirical risk minimizationcommittee classifier

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Abstract computational complexity for mathematical programming problems (90C60) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• On the computational complexity of the minimum committee problem
• The densest hemisphere problem
• On the complexity of locating linear facilities in the plane

This page was built for publication: Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning