Theoretical and Empirical Analysis of a Parallel Boosting Algorithm.
Uday KamathCarlotta DomeniconiKenneth A. De JongPublished in: CoRR (2015)
Keyphrases
- parallel implementation
- learning algorithm
- times faster
- k means
- significant improvement
- theoretical analysis
- improved algorithm
- convergence rate
- computational complexity
- optimization algorithm
- np hard
- experimental evaluation
- recognition algorithm
- computational cost
- detection algorithm
- selection algorithm
- worst case
- dynamic programming
- decision tree algorithm
- preprocessing
- objective function
- parallel version
- linear programming
- computationally efficient
- particle swarm optimization
- input data
- high accuracy
- search space
- face recognition