Committee polyhedral separability: complexity and polynomial approximation

DOI10.1007/s10994-015-5505-0zbMath1343.68198MaRDI QIDQ890319

Mikhail Yu. Khachay

Publication date: 10 November 2015

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-015-5505-0

zbMATH Keywords

computational complexity; approximability; affine committees; polyhedral separability

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

68T05: Learning and adaptive systems in artificial intelligence

90C27: Combinatorial optimization

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68W25: Approximation algorithms

Uses Software

• AdaBoost.MH