Abstract
In this paper, we focus on algorithms for Robust Procrustes Analysis that are used to rotate a solution of coordinates towards a target solution while controlling outliers. Verboon (1994) and Verboon and Heiser (1992) showed how iterative weighted least-squares can be used to solve the problem. Kiers (1997) improved upon their algorithm by using iterative majorization. In this paper, we propose a new method called “weighted majorization” that improves on the method by Kiers (1997). A simulation study shows that compared to the method by Kiers (1997), the solutions obtained by weighted majorization are in almost all cases of better quality and are obtained significantly faster.
| Original language | English |
|---|---|
| Title of host publication | Studies in Classification, Data Analysis, and Knowledge Organization |
| Editors | Maurizio Vichi, Paola Monari, Stefania Mignani, Angela Montanari |
| Publisher | Springer Science+Business Media |
| Pages | 151-158 |
| Number of pages | 8 |
| Edition | 211289 |
| ISBN (Print) | 9783319557076, 9783319557229, 9783540238096 |
| DOIs | |
| Publication status | Published - 2005 |
| Event | Biannual meeting of the Classification and Data Analysis Group of the Italian Statistical Society, CLADAG 2003 - Bologna, Italy Duration: 22 Sept 2003 → 24 Sept 2003 |
Publication series
| Series | Studies in Classification, Data Analysis, and Knowledge Organization |
|---|---|
| Number | 211289 |
| Volume | 0 |
| ISSN | 1431-8814 |
Conference
| Conference | Biannual meeting of the Classification and Data Analysis Group of the Italian Statistical Society, CLADAG 2003 |
|---|---|
| Country/Territory | Italy |
| City | Bologna |
| Period | 22/09/03 → 24/09/03 |
Bibliographical note
Publisher Copyright:© 2005, Springer-Verlag. Heidelberg 2005.
Fingerprint
Dive into the research topics of 'An improved majorization algorithm for Robust Procrustes analysis'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver