Andrews plot

In data visualization, an Andrews plot or Andrews curve is a way to visualize structure in high-dimensional data. It is basically a rolled-down, non-integer version of the Kent-Kiviat radar chart, or a smoothened version of a parallel coordinate plot.

A value x is a high-dimensional datapoint if it is an element of R d . We can represent high-dimensional data with a number for each of their dimensions, x = { x 1 , x 2 , … x d } . To visualize them, the Andrews plot defines a finite Fourier series:

f x ( t ) = x 1 2 + x 2 sin ⁡ ( t ) + x 3 cos ⁡ ( t ) + x 4 sin ⁡ ( 2 t ) + x 5 cos ⁡ ( 2 t ) + …

This function is then plotted for − π < t < π . Thus each data point may be viewed as a line between − π and π . This formula can be thought of as the projection of the data point onto the vector:

( 1 2 , sin ⁡ ( t ) , cos ⁡ ( t ) , sin ⁡ ( 2 t ) , cos ⁡ ( 2 t ) , … )

If there is structure in the data, it may be visible in the Andrews' curves of the data.

These curves have been utilized in fields as different as biology, neurology, sociology and semiconductor manufacturing. Some of their uses include the quality control of products, the detection of period and outliers in time series, the visualization of learning in artificial neural networks, and correspondence analysis.

Theoretically, it is possible to project them onto an n-sphere. The projection onto the circle results in the aforementioned Radar chart. This could prove to be a powerful computer-aided multivariable visualization method if, upon projection onto the common tridimensional sphere, the layers are given some degree of transparency on their alpha channel so as to allow to see through.