An exact polynomial time algorithm for computing the least trimmed squares estimate.
Karel KloudaPublished in: Comput. Stat. Data Anal. (2015)
Keyphrases
- computational complexity
- estimation algorithm
- worst case
- search space
- optimal solution
- high accuracy
- k means
- computational cost
- experimental evaluation
- learning algorithm
- tree structure
- optimization algorithm
- segmentation algorithm
- dynamic programming
- significant improvement
- np hard
- improved algorithm
- particle swarm optimization
- preprocessing
- detection algorithm
- matching algorithm
- classification algorithm
- brute force
- np hardness
- recognition algorithm
- polynomial time complexity
- ant colony optimization
- clustering method
- cost function
- special case
- lower bound
- search algorithm
- similarity measure