An exact least trimmed squares algorithm for a range of coverage values

Journal of Computational and Graphical Statistics

Volumn 19, Issue 1, 2010, Pages 191-204

  Hofmann, Marc ^a   Gatu, Cristian ^b,c   Kontoghiorghes, Erricos John ^c,d  

^a UNIVERSITY OF NEUCHÂTEL   (Switzerland)

^b ALEXANDRU IOAN CUZA UNIVERSITY OF IASI   (Romania)

^c UNIVERSITY OF CYPRUS   (Cyprus)

^d QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Outliers; QR factorization; Regression tree algorithms; Robust estimation

Indexed keywords

EID: 77749280612     PISSN: 10618600     EISSN: None     Source Type: Journal    
DOI: 10.1198/jcgs.2009.07091     Document Type: Article

References (27)

1. Agulló, J. (2001), "New Algorithms for Computing the Least Trimmed Squares Regression Estimator," Computational Statistics and Data Analysis, 36, 425-439. [192,194,198,201,203]
2. Alexander, S. T., Pan, C.-T., and Plemmons, R. J. (1988), "Analysis of a Recursive Least Squares Hyperbolic Rotation Algorithm for Signal Processing," Linear Algebra and Its Applications, 98, 3-40. [199]
3. Atkinson, A. C., and Cheng, T.-C. (1999), "Computing Least Trimmed Squares Regression With the Forward Search," Statistics and Computing, 9, 251-263. [195,196]
4. Belsley, D. A., Kuh, A. E., and Welsch, R. E. (1980), Regression Diagnostics: Identifying Influential Data and Sources of Collinearity, New York: Wiley. [193]
5. Björck, Å., Park, H., and Eldén, L. (1994), "Accurate Downdating of Least Squares Solutions," SIAM Journal on Matrix Analysis and Applications, 15 (2), 549-568. [194]
6. Burks, A.W.,Warren, D.W., and Wright, J. B. (1954), "An Analysis of a Logical Machine Using Parenthesis-Free Notation," Mathematical Tables and Other Aids to Computation, 8 (46), 53-57. [195]
7. Dongarra, J. J., Bunch, J. R., Moler, C. B., and Stewart, G. W. (1979), LINPACK Users' Guide, Philadelphia: SIAM. [194]
8. Donoho, D. L., and Huber, P. J. (1983), "The Notion of Breakdown Point," in A Festschrift for Erich L. Lehmann in Honor of His Sixty-Fifth Birthday, eds. P. J. Bickel, K. A. Doksum, E. L. Lehman, and J. L. Hodges, CRC Press. [192]
9. Furnival, G., and Wilson, R. (1974), "Regression by Leaps and Bounds," Technometrics, 16, 499-511. [193]
10. Gatu, C., and Kontoghiorghes, E. J. (2003), "Parallel Algorithms for Computing All Possible Subset Regression Models Using the QR Decomposition," Parallel Computing, 29 (4), 505-521. [193]
11. Gatu, C., and Kontoghiorghes, E. J. (2006), "Branch-and-Bound Algorithms for Computing the Best Subset Regression Models," Journal of Computational and Graphical Statistics, 15, 139-156. [193,202]
12. Gatu, C., Yanev, P., and Kontoghiorghes, E. J. (2007), "A Graph Approach to Generate All Possible Regression Submodels," Computational Statistics and Data Analysis, 52, 799-815. [193]
13. Gill, P. E., Golub, G. H., Murray, W., and Saunders, M. A. (1974), "Methods for Modifying Matrix Factorizations," Mathematics of Computations, 28, 505-535. [194,198]
14. Golub, G. H., and Van Loan, C. F. (1996), Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences (3rd ed.), Baltimore, MD: Johns Hopkins University Press. [194,198,199]
15. Hawkins, D. M. (1994), "The Feasible Solution Algorithm for Least Trimmed Squares Regression," Computational Statistics and Data Analysis, 17, 185-196. [192]
16. Hawkins, D. M., and Olive, D. J. (1999), "Improved Feasible Solution Algorithms for High Breakdown Estimation," Computational Statistics and Data Analysis, 30, 1-11. [192]
17. Hofmann, M., Gatu, C., and Kontoghiorghes, E. J. (2007), "Efficient Algorithms for Computing the Best-Subset Regression Models for Large-Scale Problems," Computational Statistics and Data Analysis, 52, 16-29. [195, 200]
18. Hössjer, O. (1995), "Exact Computation of the Least Trimmed Squares Estimate in Simple Linear Regression,"Computational Statistics and Data Analysis, 19 (3), 265-282. [192]
19. Morgenthaler, S. (1991), "A Note on Efficient Regression Estimators With Positive Breakdown Point," Statistics and Probability Letters, 11, 469-472. [193]
20. Narendra, P. M., and Fukunaga, K. (1977), "A Branch and Bound Algorithm for Feature Subset Selection," IEEE Transactions on Computers, 26 (9), 917-922. [194]
21. Newell, A., and Shaw, J. C. (1957), "Programming the Logic Theory Machine" in Proceedings of the Western Joint Computer Conference, Institute of Radio Engineers, pp. 230-240. [195]
22. Rousseeuw, P. J. (1984), "Least Median of Squares Regression," Journal of the American Statistical Association, 79, 871-880. [192]
23. Rousseeuw, P. J. (1997), "Introduction to Positive-Breakdown Methods," in Handbook of Statistics, Vol.15, eds. G. S. Maddala and C. R. Rao, Elsevier, pp. 101-121. [192,193]
24. Rousseeuw, P. J., and Leroy, A. M. (1987), Robust Regression and Outlier Detection, Wiley. [192]
25. Rousseeuw, P. J., and Van Driessen, K. (2006), "Computing LTS Regression for Large Data Sets," Data Mining and Knowledge Discovery, 12, 29-45. [192,196,200]
26. Smith, D. M., and Bremner, J. M. (1989), "All Possible Subset Regressions Using the QR Decomposition," Computational Statistics and Data Analysis, 7 (3), 217-235. [193]
27. Stefanski, L. A. (1991), "A Note on High-Breakdown Estimators," Statistics and Probability Letters, 11, 353-358. [193]