Computing the least median of squares estimator in time O(nd)

Lecture Notes in Computer Science

Volumn 3480, Issue I, 2005, Pages 697-706

  Bernholt, Thorsten ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ESTIMATION; PARAMETER ESTIMATION; REGRESSION ANALYSIS; STATISTICAL METHODS;

LEAST MEDIAN OF SQUARES (LMS) ESTIMATORS; RANDOMIZED ALGORITHM; REGRESSION HYPERPLANES;

COMPUTATION THEORY;

EID: 24944548364     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11424758_72     Document Type: Conference Paper

References (21)

1. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
2. T. M. Chan. Geometric applications of a randomized optimization technique. Discrete & Computational Geometry, 22:547-567, 1999.
3. T. M. Chan. Low-dimensional linear programming with violations. In IEEE Symposium on Foundations of Computer Science, pages 570-579, 2002.
4. H. Chien and W. Steiger. Some geometric lower bounds. In ISAAC: 6th International Symposium on Algorithms and Computation, pages 72-81, 1995.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (Second Edition). MIT Press & McGraw-Hill, 2001.
6. D. L. Donoho and J. Huber. The notion of breakdown point. In P. Bickel, K. Doksum, and J. L. Hodges, editors, A Festschrift for Erich L. Lehmann, pages 157-184, 1985.
7. P. Eades and B. McKay. An algorithm for generating subsets of fixed size with a strong minimal change property. Information Processing Letters, 19:131-133, 1984.
8. H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. Journal Computer and System Sciences, 38:165-194, 1989, Corrigendum in 42:249-251,1991.
9. H. Edelsbrunner and D. L. Souvaine. Computing least median of squares regression line and guided topological sweep. Journal of the American Statistical Association, 85:115-119, 1990.
10. J. Erickson, S. Har-Peled, and D. M. Mount. On the least median square problem. In ACM Symposium on Computational Geometry, 2004.
11. 2) problems in computational geometry. Computational Geometry, 5:165-185, 1995.
12. R. M. Karp. Probabilistic recurrence relations. Journal of the Association of Computer Machinery, 41(6):1136-1150, 1994.
13. Y. Li, L-Q. Xu, G. Morrison, C. Nightingale, and J. Morphett. Robust panorama from mpeg video. In IEEE International Conference on Multimedia and Expo 2003 (ICME '03), pages 81-84, 2003.
14. D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu. Quantile approximation for robust statistical estimation and k-enclosing problems. International Journal of Computational Geometry and Applications, 10:593-608, 2000.
15. D. M. Mount, N. S. Netanyahu, K. Romanik, R. Silverman, and A. Y. Wu. A practical approximation algorithm for the LMS line estimator. In Symposium on Discrete Algorithms, pages 473-482, 1997.
16. C. F. Olson. An approximation algorithm for least median of squares regression. Information Processing Letters, 63(5):237-241, 1997.
17. O. Pizarro and H. Singh. Toward large-area mosaicing for underwater scientific applications. IEEE Journal of Oceanic Engineering, 28(4):651-672, 2003.
18. H. Plets and C. Vynckier. An analysis of the incidence of the vega phenomenon among main-sequence and post main-sequence stars. Astronomy and Astrophysics, 343:496-506, 1999.
19. E. Rafalin, D. Souvaine, and I. Streinu. Topological sweep in degenerate cases. In International Workshop on Algorithm Engineering and Experiments, pages 155-165, 2002.
20. P. J. Rousseeuw and A. M. Leroy. Robust Regression and Outlier Detection. Wiley, 1987.
21. A. J. Stromberg. Computing the exact least median of squares estimate and stability diagnostics in multiple linear regression. SIAM Journal on Scientific Computing, 14(6):1289-1299, 1993.