Evolutionary algorithms for robust methods
| dc.contributor.author | Morell, Oliver | |
| dc.contributor.author | Nunkesser, Robin | |
| dc.date.accessioned | 2009-01-13T07:55:54Z | |
| dc.date.available | 2009-01-13T07:55:54Z | |
| dc.date.issued | 2009-01-13T07:55:54Z | |
| dc.description.abstract | A drawback of robust statistical techniques is the increased computational effort often needed compared to non robust methods. Robust estimators possessing the exact fit property, for example, are NP-hard to compute. This means that — under the widely believed assumption that the computational complexity classes NP and P are not equal — there is no hope to compute exact solutions for large high dimensional data sets. To tackle this problem, search heuristics are used to compute NP-hard estimators in high dimensions. Here, an evolutionary algorithm that is applicable to different robust estimators is presented. Further, variants of this evolutionary algorithm for selected estimators — most prominently least trimmed squares and least median of squares—are introduced and shown to outperform existing popular search heuristics in difficult data situations. The results increase the applicability of robust methods and underline the usefulness of evolutionary computation for computational statistics. | en |
| dc.identifier.uri | http://hdl.handle.net/2003/25985 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-12759 | |
| dc.language.iso | en | de |
| dc.subject | Evolutionary algorithms | en |
| dc.subject | Least median of squares (LMS) | en |
| dc.subject | Least quantile of squares (LQS) | en |
| dc.subject | Least quartile difference (LQD) | en |
| dc.subject | Least trimmed squares (LTS) | en |
| dc.subject | Robust regression | en |
| dc.subject.ddc | 004 | |
| dc.title | Evolutionary algorithms for robust methods | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | en |
| dcterms.accessRights | open access |