Committee polyhedral separability: complexity and polynomial approximation
From MaRDI portal
Publication:890319
DOI10.1007/s10994-015-5505-0zbMath1343.68198OpenAlexW575489580MaRDI QIDQ890319
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (1)
Uses Software
Cites Work
- Bagging predictors
- On the computational complexity of the minimum committee problem
- Kernel methods in machine learning
- Computational complexity of the minimum committee problem and related problems
- On the complexity of polyhedral separability
- The weighted majority algorithm
- Committees of systems of linear inequalities
- Adaptive game playing using multiplicative weights
- On the complexity of locating linear facilities in the plane
- Inapproximability results for set splitting and satisfiability problems with no mixed clauses
- Boosting a weak learning algorithm by majority
- Support-vector networks
- Constraint elimination method for the committee problem
- The hardness of 3-uniform hypergraph coloring
- Parallel computations and committee constructions
- A threshold of ln n for approximating set cover
- Probabilistic checking of proofs
- Statistical Decision Functions
- Using iterated bagging to debias regressions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Committee polyhedral separability: complexity and polynomial approximation
