By Topic

On Edgeworth's method for minimum absolute error linear regression

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hawley, R.W. ; Sandia Nat. Labs., Albuquerque, NM, USA ; Gallagher, N.C., Jr.

The Edgeworth (1887) algorithm for minimizing absolute error is known to suffer from convergence problems when the data contains degeneracies. In this paper, it is shown that for the particular problem of fitting a line to a set of uniformly sampled data, the problem of degeneracy may be easily avoided by utilizing a stable sorter for the weighted median operation needed in Edgeworth's method. Proof of convergence is based on establishing an equivalence between the use of a stable sorting routine and perturbing the original data in such a way that no degeneracies exist. In addition, it will be shown that the data set size may be selected so that the minimum error fit is unique

Published in:

Signal Processing, IEEE Transactions on  (Volume:42 ,  Issue: 8 )