Skip to main content
Download PDF
- Main
Distance-Based Transformations of Biplots
Abstract
In principal component analysis and related techniques, we approximate (in the least squares sense) as n x m matrix F by an n x m matrix G which satisfies rank(G) ≤ p, where p < min(n,m). Or equivalenty, we want to find an n x p matrix X and an m x p matrix Y such that G = XY' approximates F as closely as possible. The rows of X and Y are then often used in graphical displays. In particular, biplots represent X and Y jointly as n + m points in Euclidean p space.
Main Content
For improved accessibility of PDF content, download the file to your device.
If you recently published or updated this item, please wait up to 30 minutes for the PDF to appear here.
Enter the password to open this PDF file:
File name:
-
File size:
-
Title:
-
Author:
-
Subject:
-
Keywords:
-
Creation Date:
-
Modification Date:
-
Creator:
-
PDF Producer:
-
PDF Version:
-
Page Count:
-
Page Size:
-
Fast Web View:
-
Preparing document for printing…
0%