Asymptotic analysis of the Forward Search
The Forward Search is an iterative algorithm concerned with detection of outliers and other unsuspected structures in data. This approach has been suggested, analysed and applied for regression models in the monograph Atkinson and Riani (2000). An asymptotic analysis of the Forward Search is made. The argument involves theory for a new class of weighted and marked empirical processes, quantile process theory, and a fixed point argument to describe the iterative element of the procedure.
|Date of creation:||02 Oct 2013|
|Date of revision:|
|Contact details of provider:|| Web page: http://www.econ.au.dk/afn/|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Marco Riani & Anthony C. Atkinson & Andrea Cerioli, 2009.
"Finding an unknown number of multivariate outliers,"
Journal of the Royal Statistical Society Series B,
Royal Statistical Society, vol. 71(2), pages 447-466.
- Marco Riani & Anthony C. Atkinson & Andrea Cerioli, 2009. "Finding an unknown number of multivariate outliers," LSE Research Online Documents on Economics 30462, London School of Economics and Political Science, LSE Library.
- Bent Nielsen & Soren Johansen, 2010. "Discussion of The Forward Search: Theory and Data Analysis," Economics Series Working Papers 2010-W02, University of Oxford, Department of Economics.
- E ric E ngler & B ent N ielsen, 2009.
"The empirical process of autoregressive residuals,"
Royal Economic Society, vol. 12(2), pages 367-381, 07.
- Eric Engler & Bent Nielsen, 2007. "The empirical process of autoregressive residuals," Economics Series Working Papers 2007-W01, University of Oxford, Department of Economics.
- Bent Nielsen & Eric Engler, 2007. "The empirical process of autoregressive residuals," Economics Papers 2007-W01, Economics Group, Nuffield College, University of Oxford.
When requesting a correction, please mention this item's handle: RePEc:aah:create:2013-05. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.