BACON: blocked adaptive computationally efficient outlier nominators


Billor N., Hadi A., Velleman P.

COMPUTATIONAL STATISTICS & DATA ANALYSIS, cilt.34, ss.279-298, 2000 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 34 Konu: 3
  • Basım Tarihi: 2000
  • Doi Numarası: 10.1016/s0167-9473(99)00101-2
  • Dergi Adı: COMPUTATIONAL STATISTICS & DATA ANALYSIS
  • Sayfa Sayıları: ss.279-298

Özet

Although it is customary to assume that data are homogeneous, in fact, they often contain outliers or subgroups. Methods for identifying multiple outliers and subgroups must deal with the challenge of establishing a metric that is not itself contaminated by inhomogeneities by which to measure how extraordinary a data point is. For samples of a sufficient size to support sophisticated methods, the computation cost often makes outlier detection unattractive. All multiple outlier detection methods have suffered in the past from a computational cost that escalated rapidly with the sample size. We propose a new general approach, based on the methods of Hadi (1992a,1994) and Hadi and Simonoff (1993) that can be computed quickly - often requiring less than five evaluations of the model being fit to the data, regardless of the sample size. Two cases of this approach are presented in this paper (algorithms for the detection of outliers in multivariate and regression data). The algorithms, however, can be applied more broadly than to these two cases. We show that the proposed methods match the performance of more computationally expensive methods on standard test problems and demonstrate their superior performance on large simulated challenges. (C) 2000 Elsevier Science B.V. All rights reserved.