Abstract

The method of ordinary least squares approximation is not resistant to data points that cause a disproportionate influence in the fit. When outliers are known to exist in the data, robust estimation algorithms are preferred. However, the performance of most robust estimation algorithms degrades in higher dimensions due to factorial complexity and sparse data. A new polynomial time algorithm RIPPLE has been developed to produce robust estimations of data obtained from piecewise linear functions. This paper presents a comparison between the new algorithm RIPPLE and a standard robust estimation algorithm LMS.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.