Watching steps of a grand tour implementation

• Autorzy: Bartkowiak A. , Szustalewicz A.
• Języki publikacji: EN

Abstrakty

EN

Bartkowiak and Szustalewicz, 1997 (B&Sz), have proposed an implementation of the grand tour algorithm designed specially to detect outliers in multivariate data. The algorithm work by performing a sequence of rotations and projections onto a specific 2D-plane (Π _proj). This is equivalent to perform a series of rotations yielding transformed coordinates of the data: X^(tr) = XA, with A being the rotation matrix, while X and X,sup>(tr) denote the data matrices before and after the rotation appropriately. A superimposed concentration ellipse indicates the outstanding points. We complement the paper of B&Sz by considering some details and variants of the implementation of the grand tour algorithm. In particular we watch the trajectories of the projected points. Our concern is the denseness of the watched projctions. We look at the trajectories of the projected point visible in the Π _proj plane and the frequencies of thier appearing in various sectors of that plane. In the Appendix we present the derivation of the formula for the rotation matrix A employed in each step of the algorithm for obtaining the transformed data coordinates.

Słowa kluczowe

EN

dynamic graphics; grand tour; rotation; projection; uniform distribution

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 1998
• Tom: Vol. 7, No. 3
• Strony: 655--680
• Opis fizyczny: Bibliogr. 6 poz.

Twórcy

autor

Bartkowiak A.

autor

Szustalewicz A.

• Institute of Computer Science, University of Wrocław 51-151, Wrocław, Przesmyckiego 20, Poland