Abstract
During a forward search the plot of minimum Mahalanobis distances of observations not in the subset provides a test for outliers. However, if clusters are present in the data, their simple identification requires that there arc searches that initially include a preponderance of observations from each of the unknown clusters. We use random starts to provide such searches, combined with simulation envelopes for precise inference about clustering.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ATKINSON, A.C. and RIANI, M (2000): Robust Diagnostic Regression Analysis, Springer-Verlag, New York.
ATKINSON, A.C., RIANI, M. and CERIOLI, A. (2004): Exploring Multivariate Data with the Forward Search, Springer-Verlag, New York.
RIANI, M and ATKINSON, A.C. (2006): Finding an unknown number of multivariate outliers in larger data sets, (Submitted).
ZANI, S., RIANI, M and CORBELLINI, A. (1998): Robust bivariate boxplots and multiple outlier detection, Computational Statistics and Data Analysis, 28, 257–270.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Heidelberg
About this paper
Cite this paper
Atkinson, A., Riani, M., Cerioli, A. (2006). Random Start Forward Searches with Envelopes for Detecting Clusters in Multivariate Data. In: Zani, S., Cerioli, A., Riani, M., Vichi, M. (eds) Data Analysis, Classification and the Forward Search. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-35978-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-35978-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35977-7
Online ISBN: 978-3-540-35978-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)