A Genetic Algorithm Based Modification on the LTS Algorithm for Large Data Sets

Satman M. H.

COMMUNICATIONS IN STATISTICS-SIMULATION AND COMPUTATION, vol.41, no.5, pp.644-652, 2012 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 41 Issue: 5
  • Publication Date: 2012
  • Doi Number: 10.1080/03610918.2011.598989
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.644-652
  • Keywords: C-steps, Genetic algorithms, Least trimmed squares regression, Outliers, Robust regression, TRIMMED SQUARES REGRESSION, OUTLIERS
  • Istanbul University Affiliated: Yes


The authors introduce an algorithm for estimating the least trimmed squares (LTS) parameters in large data sets. The algorithm performs a genetic algorithm search to form a basic subset that is unlikely to contain outliers. Rousseeuw and van Driessen (2006) suggested drawing independent basic subsets and iterating C-steps many times to minimize LTS criterion. The authors 'algorithm constructs a genetic algorithm to form a basic subset and iterates C-steps to calculate the cost value of the LTS criterion. Genetic algorithms are successful methods for optimizing nonlinear objective functions but they are slower in many cases. The genetic algorithm configuration in the algorithm can be kept simple because a small number of observations are searched from the data. An R package is prepared to perform Monte Carlo simulations on the algorithm. Simulation results show that the performance of the algorithm is suitable for even large data sets because a small number of trials is always performed.