Stochastic global optimization methods. part 1: clustering methods
Mathematical Programming: Series A and B
New algorithms for computing the least trimmed squares regression estimator
Computational Statistics & Data Analysis
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
On the Surprising Behavior of Distance Metrics in High Dimensional Spaces
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Editorial: Special issue on variable selection and robust procedures
Computational Statistics & Data Analysis
Benchmark testing of algorithms for very robust regression: FS, LMS and LTS
Computational Statistics & Data Analysis
Hi-index | 0.03 |
The problem of providing efficient and reliable robust regression algorithms is considered. The impact of global optimization methods, such as stopping conditions and clustering techniques, in the calculation of robust regression estimators is investigated. The use of stopping conditions permits us to devise new algorithms that perform as well as the existing algorithms in less time and with adaptive algorithm parameters. Clustering global optimization is shown to be a general framework encompassing many of the existing algorithms.