The University of Southampton
University of Southampton Institutional Repository

Outlier detection and least trimmed squares approximation using semi-definite programming

Outlier detection and least trimmed squares approximation using semi-definite programming
Outlier detection and least trimmed squares approximation using semi-definite programming
Robust linear regression is one of the most popular problems in the robust statistics community. It is often conducted via least trimmed squares, which minimizes the sum of the k smallest squared residuals. Least trimmed squares has desirable properties and forms the basis on which several recent robust methods are built, but is very computationally expensive due to its combinatorial nature. It is proven that the least trimmed squares problem is equivalent to a concave minimization problem under a simple linear constraint set. The “maximum trimmed squares”, an “almost complementary” problem which maximizes the sum of the q smallest squared residuals, in direct pursuit of the set of outliers rather than the set of clean points, is introduced. Maximum trimmed squares (MTS) can be formulated as a semi-definite programming problem, which can be solved efficiently in polynomial time using interior point methods. In addition, under reasonable assumptions, the maximum trimmed squares problem is guaranteed to identify outliers, no mater how extreme they are.

0167-9473
3212-3226
Nguyen, T.D.
a6aa7081-6bf7-488a-b72f-510328958a8e
Welsch, R.
2e57ffb9-41e2-46c1-be43-9c2c62a6a9b7
Nguyen, T.D.
a6aa7081-6bf7-488a-b72f-510328958a8e
Welsch, R.
2e57ffb9-41e2-46c1-be43-9c2c62a6a9b7

Nguyen, T.D. and Welsch, R. (2010) Outlier detection and least trimmed squares approximation using semi-definite programming. Computational Statistics and Data Analysis, 54 (12), 3212-3226. (doi:10.1016/j.csda.2009.09.037).

Record type: Article

Abstract

Robust linear regression is one of the most popular problems in the robust statistics community. It is often conducted via least trimmed squares, which minimizes the sum of the k smallest squared residuals. Least trimmed squares has desirable properties and forms the basis on which several recent robust methods are built, but is very computationally expensive due to its combinatorial nature. It is proven that the least trimmed squares problem is equivalent to a concave minimization problem under a simple linear constraint set. The “maximum trimmed squares”, an “almost complementary” problem which maximizes the sum of the q smallest squared residuals, in direct pursuit of the set of outliers rather than the set of clean points, is introduced. Maximum trimmed squares (MTS) can be formulated as a semi-definite programming problem, which can be solved efficiently in polynomial time using interior point methods. In addition, under reasonable assumptions, the maximum trimmed squares problem is guaranteed to identify outliers, no mater how extreme they are.

This record has no associated files available for download.

More information

Published date: 1 December 2010
Organisations: Statistics, Management, Operational Research

Identifiers

Local EPrints ID: 181479
URI: http://eprints.soton.ac.uk/id/eprint/181479
ISSN: 0167-9473
PURE UUID: 74330ae7-8e40-4328-8697-17bb4819e950
ORCID for T.D. Nguyen: ORCID iD orcid.org/0000-0002-4158-9099

Catalogue record

Date deposited: 14 Apr 2011 08:45
Last modified: 14 Mar 2024 02:56

Export record

Altmetrics

Contributors

Author: T.D. Nguyen ORCID iD
Author: R. Welsch

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×