Abstract
Projection pursuit is used to find interesting lowdimensional projections of highdimensional data by optimizing an index over all possible projections. Most indexes have been developed to detect departure from known distributions, such as normality, or to find separations between known groups. Here, we are interested in finding projections revealing potentially complex bivariate patterns, using new indexes constructed from scagnostics and a maximum information coefficient, with a purpose to detect unusual relationships between model parameters describing physics phenomena. The performance of these indexes is examined with respect to ideal behaviour, using simulated data, and then applied to problems from gravitational wave astronomy. The implementation builds upon the projection pursuit tools available in the R package, tourr, with indexes constructed from code in the R packages, binostics, minerva and mbgraphic.
Introduction
The term “projection pursuit” (PP) was coined by Friedman and Tukey (1974) to describe a procedure for searching high (say \(p\))dimensional data for “interesting” lowdimensional projections (\(d=1\) or \(2\) usually). The procedure, originally suggested by Kruskal (1969), involves defining a criterion function, or index, that measures the “interestingness” of each \(d\)dimensional projection of \(p\)dimensional data. This criterion function is optimized over the space of all \(d\)dimensional projections of \(p\)space, searching for both global and local maxima. It is hoped that the resulting solutions reveal lowdimensional structure in the data not found by methods such as principal component analysis. Projection pursuit is primarily used for visualization, with the projected data always reported as plots.
A large number of projection pursuit indexes have been developed, primarily based on departure from normality, which includes clusters, outliers and skewness, and also for finding separations between known groups (e.g. Friedman 1987; Hall 1989; Cook et al. 1992; Naito 1997; Lee et al. 2005; Ahn et al. 2003; Hou and Wentzell 2014; Jones and Sibson 1987; RodriguezMartinez et al. 2010; Pan et al. 2000; Ferraty et al. 2013; Loperfido 2018). Less work has been done on indexes to find nonlinear dependence between variables, focused on \(d=2\), which motivates this research.
The driving application is from physics, to aid the interpretation of model fits on experimental results. A physical model can be considered to be a set of \(p\) free parameters, that cannot be measured directly and are determined by fitting a set of \(q~ (p<q)\) experimental observations, for which predictions can be made once the \(p\) parameters are estimated. (Note here, that while we may have analytic expressions for the predictions, this is not always the case and we often have to rely on numerical computation.) Different sets of model parameters (\(n\)) found to be compatible with the experimental results within a selected level of confidence yield the data to be examined using projection pursuit. A single prediction can be a complicated function of all of the free parameters, and typically \(q \in [100,1000]\) and \(p \sim 10\). Current practice is to examine pairs of parameters, or combinations produced by intuition or prior knowledge. This begs the question, whether important nonlinear associations are missed because they are hidden in linear combinations of more than two variables.
PP can be combined with other dimension reduction methods when \(p\) is very high. For example, it can be beneficial to first do principal component analysis prior to PP, especially to remove linear dependencies before searching for other types of association. This is the approach used in Cook et al. (2018), which explores a 56dimensional parameter space, by first reducing the number of dimensions to the first six principal components, before applying projection pursuit. PCA was appropriate for this problem because reducing to principal component space removed the linear dependencies while preserving the nonlinear relationships that were interesting to discover. Some projection pursuit indexes do incorporate penalty terms to automate removing noise dimensions. It can also be important to have an efficient PP optimizer, particularly when working with high dimensions, because the search space increases exponentially with dimension.
To find appropriate projections pursuit indexes for detecting nonlinear dependencies, the literature on variable selection was a starting point. With highdimensional data, even plotting all pairs of variables can lead to too many plots, which is what “scagnostics” (Wilkinson et al. 2005; Wilkinson and Wills 2008) were developed to address by providing metrics from which to select the most interesting variable pairs. There are eight scagnostics, of which three (“convex”, “skinny” and “stringy”) are used here. The question is whether these can be adapted into projection pursuit indexes, to search for unusual features in twodimensional projections of highdimensional data. Recent PhD research by Grimm (2016) explored the behavior of scagnostics for selecting variables, and proposed two more that have nicer properties, based on smoothing splines and distance correlation. In addition, two more indexes for measuring dependence have been proposed in the machine learning literature, based on information criteria, maximal and total information coefficient (MIC and TIC) (Reshef et al. 2011), with computationally more efficient versions (MIC_e, TIC_e) (Reshef et al. 2016). These are related to original 1D projection pursuit indexes based on entropy (e.g. Huber 1985; Jones and Sibson 1987). This provides seven current indexes for measuring dependence between two variables, and each is available in an R (R Core Team 2018) package: binostics (Hofmann et al. 2019), mbgraphic (Grimm 2017) and minerva (Albanese et al. 2012).
PP index behavior can be understood and investigated more substantially when combined with a tour. A tour (Asimov 1985; Buja et al. 2005) displays a smooth sequence of low dimensional projections from high dimensions to explore multivariate data for structure such as clusters, outliers, and nonlinear relationships. Cook et al. (1995) provided an approach combining the tour algorithm with PP, to interactively both search for interesting projections, and examine the behavior of the indexes. The projection pursuit guided tour is available in the R package, tourr (Wickham et al. 2011), and provides optimization routines, and visualization.
This paper is structured as follows. Section 2 discusses index construction, and how they can be used in the guided tour. Section 3 investigates the behavior of the indexes, explored primarily using tour methods. The new guided tour with these indexes is applied to two examples from gravitational wave astronomy (Sect. 4). The latter two parts are connected in that the application of the new indexes to these problems is the main motivation for the paper, and the simulation study, in the first part, was conducted to better understand the behavior of the indexes in general. The techniques in Sect. 3 define procedures that will be generally useful for researchers developing new projection pursuit indexes to visually assess their behavior. Visual methods to diagnose the index behavior is important because PP is primarily used for visualization. The paper finishes with a discussion about the limitations of this work, and the potential future directions.
Projection pursuit index construction and optimization
A projection pursuit index (PPI) is a scalar function \(f\) defined on an \(d\)dimensional data set, computed by taking a \(d\)dimensional projection of an \(n\times p\) data matrix. Typically the definition is such that larger values of \(f\) indicate a more interesting distribution of observations, and therefore maximizing \(f\) over all possible \(d\) dimensional projections of a data set with \(p>d\) variables will find the most interesting projections. This section describes the seven indexes that are to be used to explore bivariate association. Some data preprocessing, including standardization, is advisable, prior to optimizing the PPI.
Scaling and standardization
Making a plot always involves some choice of scaling. When a scatterplot is made, effectively, albeit under the hood, the data is scaled into a range of \([a, b]\) (often \(a=0, b=1\)) on both axes to print it on a page or display in a graphics device window. The range deliminates page space within which to draw. The upshot is that the original data scale is standardized to the range and aspect ratio on the display space. It may be that the original range of one variable is \([1, 1000]\) and the other is \([1, 1.6]\) but the display linearly warps this to \([0, 1]\) and \([0, 1]\), say, giving both variables equal visual weight.
With high dimensional data, and particularly projections, it is also necessary to rescale the original range, and it is important to pay attention to what is conventional, or possible, and the effects. The PPIs also may require specific scaling for them to be effectively computed. Both of these are addressed here. The common preprocessing include:

Standardizing each variable, to have mean 0 and variance 1, so that individual variable scales do not affect the result. Different variable scales are examinable without resorting to projection pursuit, so can be handled prior to searching through high dimensions.

Sphering the highdimensional data is often done to remove linear dependence. This is typically done using principal component analysis, and using the principal components as the variables passed to PP. If linear dependence is the only structure PP is not needed, and thus this is removed before PP so that the PPIs are not distracted by simple structure.

Transform single variables to reduce skewness. It is marginal structure, visible in a single variable, which doesn’t need a multivariate technique to reveal. Skewed distributions will inadvertently affect the PPIs, distracting the search for dependence.

Remove outliers, which may be an iterative process, to discover, identify and delete. Extreme values will likely affect PPI performance. Outliers can be examined on a case by case basis later.

Possibly remove noise dimensions, which is also likely to be an iterative process. Directions where the distribution is purely noise make optimization of a PPI more difficult. If a variable is suspected to have little structure and relationship with other variables, conducting PP on the subset of variables without them may improve the efficiency of the search.

Centering and scaling of the projected data, can be helpful visually. If the data has a small amount of nonnormal distribution in some directions, the projected data can appear to wander around the plot window during a tour. It doesn’t matter what the center of the projected data is, so centering removes a wandering scatterplot. Less commonly, it may be useful to scale the projected data to standard values, which would be done to remove any linear dependence remaining in the data.
New projection pursuit index functions
Table 1 summarizes the notation used for this section. Here we give an overview of the functions that are converted into projection pursuit indexes. Full details of the functions can be found in the original sources.

Scagnostics The first step to computing the scagnostics is that the bivariate data is binned, and scaled between [0,1] for calculations. The convex (Eddy 1977) and alpha hulls (Edelsbrunner et al. 1983), and the minimal spanning tree (MST) (Kruskal 1956), are computed.

Convex The ratio of the area of alpha to convex hull, \(I_{convex}= \frac{area(A)}{area(H)}\). This is the only measure where interesting projections will take low values, with a maximum of 1 if both areas are the same. Thus \(1c_{convex}\) is used.

Skinny The ratio of the perimeter to the area of the alpha hull, \(I_{skinny} = 1  \frac{\sqrt{4\pi area(A)}}{perimeter(A)}\), where the normalization is chosen such that \(I_{skinny} = 0\) for a full circle. Values close to 1 indicate a skinny polygon.

Stringy Based on the MST, \(I_{stringy} = \frac{diameter(MST)}{length(MST)}\) where the diameter is the longest connected path, and the length is the total length (sum of all edges). If the MST contains no branches \(I_{skinny} = 1\).


Association The index functions are available in Grimm (2017), and are defined to range in [0,1]. Both functions in the mbgraphic package can bin the data before computing the index, for computational performance.

dcor2D: This function is based on distance correlation (Székely et al. 2007), which is designed to find both linear and nonlinear dependencies between variables. It involves computing the distances between pairs of observations, conducting an analysis of variance type breakdown of the distances relative to each variable, and the result is then passed to the usual co variance and hence correlation formula. The function wdcor, in the R package, extracat (Pilhöfer and Unwin 2013), computes the statistic, and the mbgraphic package utilises this function.

splines2D: Measures nonlinear dependence by fitting a spline model (Wahba 1990) of the projected data matrix entries \(\varvec{Y}_2\) on \(\varvec{Y}_1\) and also \(\varvec{Y}_1\) on \(\varvec{Y}_2\), using the gam function in the R package, mgcv (Wood et al. 2016). The index compares the variance of the residuals:
$$\begin{aligned} I_{splines2d} = max \left( 1 \frac{Var(res_{\varvec{Y}_1\sim \varvec{Y}_2})}{Var(\varvec{Y}_1)}, 1\frac{Var(res_{\varvec{Y}_2\sim {\varvec{Y}_1}})}{Var(\varvec{Y}_2)}\right) , \end{aligned}$$(1)which takes large values if functional dependence is strong.


Information The index functions (Reshef et al. 2011) nonparametricly measure nonlinear association by computing the mutual information,
$$\begin{aligned} \varvec{I} = \sum _{by_1}\sum _{by_2} p(by_1, by_2) log(p(by_1, by_2)/(p(by_1)p(by_2))), \end{aligned}$$(2)where \(by_1, by_2\) are binned values of the projected data, and \(p(by_1, by_2)\)is the relative bin count in each cell, and \(p(by_1), p(by_2)\) are the row and column relative counts, on a range of bin resolutions of the data. It is strictly a 2D measure. For a fixed binning, e.g. \(2\times 2\) or \(10\times 4\), the optimal binning is found by maximizing \(I\). The values of I range between \([0,1]\) because they are normalized across bins by dividing by \(log(min(\# bins_{y_1}, \# bins_{y_2}))\).

Maximum information coefficient (MIC): uses the maximum normalized \(I\) across all bin resolutions.

Total information coefficient (TIC): sums the normalized \(I\) for all bin resolutions computed. This creates a problem of scaling  there is no upper limit, although it is related to number of bins, and number of bin resolutions used. In the work below we have made empirical estimates of the maximum and scaled the TIC index using this to get it in the range \([0,1]\). This index should be more stable than MIC.

A comparison between these indexes for the purpose of variable selection, but not projection pursuit, was discussed in Grimm (2016). It is only available in German, we we summarize the main findings here. The scagnostics measures are flexible, and calculating the full set of measures provides useful guidance in variable selection. However, they are found to be highly sensitive to outlying points and sample size (as a consequence of the binning). Both splines2D and dcor2D are found to be robust in this respect, but splines2D is limited to functional dependence, while dcor2D is found to take large values only in scenarios with large linear correlation. The mutual information based index functions (MIC, TIC) are found to be flexible, but are sensitive to the sample size and often take relatively large values even when no association is present. A brief comparison of MIC and dcor2D was also provided in Simon and Tibshirani (2014).
In addition to the seven indexes described above, we will also include the holes index available in the tourr package, see (Cook et al. 1993; Cook and Swayne 2007). This serves as a benchmark, demonstrating some desired behavior. The index takes maximum values for a central hole in the distribution of the projected data.
Optimization
Given a PPI we are confronted with the task of finding the maximum over all possible \(d\) dimensional projections. One challenge is to avoid getting trapped in local maxima that are only a result of sampling fluctuations or a consequence of a noisy index function. Posse (1995a) discusses the optimization, in particular that for most index functions and optimizers results are too local, largely dependent on starting point. Friedman (1987) suggested a twostep procedure: the first step is using a large step size to find the approximate global maximum while stepping over pseudomaxima. A second step is then starting from the projection corresponding to the approximate maximum and employing a gradient directed optimization for the identification of the maximum. For exploring highdimensional data, it can be interesting to observe local maxima as well as a global maximum, and thus a hybrid algorithm that still allows lingering but not being trapped by local maxima is ideal. In addition, being able to visually monitor the optimization and see the optimal projection in the context of neighboring projections is useful. This is provided by combining projection pursuit with the grand tour (Cook et al. 1995). The properties of a suitable optimization algorithm include monotonicity of the index value, a variable stepsize to avoid overshooting and to increase the chance of reaching the nearest maximum, and a stopping criterion allowing to move out of a local maximum and into a new search region (Wickham et al. 2011). A possible algorithm is inspired by simulated annealing and has been described in Lee et al. (2005), this has been implemented in the search_better and search_better_random search functions in the tourr package. The tourr package also provides the search_geodesic function, which first selects a promising direction by comparing index values between a selected number of small random steps, and then optimizes the function over the line along the geodesic in that direction considering projections up to \(\pi /4\) away from the current view.
Investigation of indexes
A useful projection pursuit index needs to have several properties. This has been discussed in several seminal papers, e.g. Diaconis and Freedman (1984), Huber (1985), Jones and Sibson (1987), Posse (1995a), Hall (1989). The PPI should be minimized by the normal distribution, because this is not interesting from a data exploration perspective. If all projections are normally distributed, good modelling tools already exist. A PPI should be approximately affine invariant, regardless how the projection is rotated the index value should be the same, and the scale of each variable shouldn’t affect the index value. Interestingly the original index proposed by Friedman and Tukey (1974) was not rotationally invariant. A consistent index means that small perturbations to the sample do not dramatically change the index value. This is particularly important to making optimization feasible, small angles between projections correspond to small perturbations of the sample, and thus should be small changes to index value. Posse (1995a) suggests that indexes should be resistant to features in a tail of the distribution, but this is debatable because one departure from normality that is interesting to detect are anomalous observations. Some PPI are designed precisely for these reasons. Lastly, because we need to compute the PPI over many projections, it needs to be fast to compute. These form the basis of the criteria upon which the scagnostic indexes, and the several alternative indexes are examined, as explained below.

Smoothness This is the consistency property mentioned above. The index function values are examined over interpolated tour paths, that is, the value is plotted against time, where time indexes the sequence of projections produced by the tour path. The signature of a good PPI is that the plotted function is relatively smooth. The interpolation path corresponds to small angle changes between projections, so the value should be very similar.

Squintability Tukey and Tukey (1981) introduced the idea of squint angle to indicate resolution of structure in the data. Fine structure like the parallel planes in the infamous RANDU data (Marsaglia 1968) has a small squint angle because you have to be very close to the optimal projection plane to be able to see the structure. Structures with small squint angle are difficult to find, because the optimization algorithm needs to get very close to begin hillclimbing to the optimum. The analyst doesn’t have control over the data structure, but does have control over the PPI. Squintability is about the shape of the PPI over all projections. It should have smooth low values for noise projections and a clearly larger value, ideally with a big squint angle, for structured projections. The optimizer should be able to clearly see the optimal projections as different from noise. To examine squintability, the PPI values are examined on interpolated tour paths between a noise projection and a distant structured projection.

Flexibility An analyst can have a toolbox of indices that may cover the range of fine and broad structure, which underlies the scagnostics suite. Early indexes, based on density estimation could be programmed to detect fine or large structure by varying the binwidth. This is examined by using a range of structure in the simulated data examples.

Rotation invariance The orientation of structure within a projection plane should not change the index value. This is especially important when using the projection pursuit guided tour, because the tour path is defined between planes, along a geodesic path, not bases within planes. If a particular orientation is more optimal, this will get lost as the projection shown pays no attention to orientation. Buja et al. (2005) describes alternative interpolation paths based on Givens and Householder rotations which progress from basis to basis. It may be possible to ignore rotation invariance with these interpolations but there isn’t a current implementation, primarily because the withinplane spin that is generated is distracting from a visualization perspective. Rotation invariance is checked for the proposed PPIs by rotating the structured projection, within the plane.

Speed Being fast to compute allows the index to be used in realtime in a guided tour, where the optimization can be watched. When the computations are shifted offline, to watch in replay, computation times matter less. This is checked by comparing times for benchmark scenarios with varying sample size.
Simulation study setup
Data construction
Three families of data simulations are used for examining the behavior of the index functions. Each generates structure in two variables, with the remaining variables containing various types of noise. This is a very simple construction, because there is no need for projection pursuit to find the structure, one could simply use the PPIs on pairs of variables. However, it serves the purpose to also evaluate the PPIs. The three data families are explained below. In each set, \(n\) is used for the number of points, \(p\) is the number of dimensions, and \(d=2\) is the projection dimension. The three structures were selected to cover both functional and nonfunctional dependence, different types of nuisance distributions and different structure size and squintability properties.

Pipe nuisance directions are generated by sampling independently from a uniform distribution between \([1,1]\), and the circle is generated by sampling randomly on a 2D circle, and adding a small radial noise. The circle should be easy to see by some indices because it is large structure, but the nonlinearity creates a complication.

Sine nuisance directions are generated by sampling independently from a standard normal distribution, and the sine curve is generated by \(x_p = \sin (x_{p1}) + \mathrm {jittering}\). The sine is a medium nonlinear structure, which should be visible to multiple indices.

Spiral nuisance directions are generated by sampling independently from a normal distribution, and the structure directions are sampled from an Archimedean spiral, i.e. \(r = a + b \theta \), with \(a=b=0.1\) and we sample angles \(\theta \) from a normal distribution with mean 0 and variance \(2\pi \), giving a spiral with higher densities at lower radii. The absolute value of \(\theta \) fixes the direction of the spiral shape. This is fine structure which is only visible close to the optimal projection.
For simplicity, in the investigations of the index behavior, we fix \(p=6\), which corresponds to two independent 2D planes containing nuisance distributions, and one 2D plane containing the structured distribution. The structured projection is in variables 5 and 6 (\(x_5, x_6\)). Two samples sizes are used: \(n=(100, 1000)\). All variables are standardized to have mean 0 and standard deviation 1. Figure 1 shows samples from each of the families, of the nuisance and structured pairs of variables. Table 2 compares the PPIs for structured projections against those for nuisance variables, based on 100 simulated data sets of each type, using sample size 1000. The lower and upper show the 5th and 95th percentile of values. The holes index is sensitive only to the pipe distribution. All other indexes, except convex show distinctly higher values for the structured projections. The convex index shows the inverse scale to other indices, thus (1convex) will be used in the assessment of performance of PPIs. The scale for the holes index in its original implementation is smaller than the others ranging from about 0.7 through 1, so it is rescaled in the performance assessment so that all indices can be plotted on a common scale of 0–1 (details are given in the “Appendix”). Similarly, the TIC index is rescaled depending on sample size.
Property assessment
The procedures for assessing the PPI properties of smoothness, squintability, flexibility, rotation invariance, and speed examined for samples from the family of data sets are:

1.
Compute the PPI values on the tour path along an interpolation between pairs of nuisance variables, \(x_1  x_2\) to \(x_3  x_4\). The result is ideally a smooth change in low values. This checks the smoothness property.

2.
Change to a tour path between a pair of nuisance variables \(x_1  x_2\) and the structured pair of variables \(x_5  x_6\) via the intermediate projection onto \(x_1  x_5\), and compute the PPI along this. This examines the squintability, and smoothness. If the function is smooth and slowly increases towards the structured projection, then the structure is visible from a distance.

3.
Use the guided tour to examine the ease of optimization. This depends on having a relatively smooth function, with structure visible from a distance. One index is optimized to show how effectively the maximum is attained, and the values for other PPIs is examined along the same path, to examine the similarity between PPIs.

4.
Rotation invariance is checked by computing PPIs on rotations of the structured projection.

5.
Computational speed for the selected indexes is examined on a range of sample sizes.
PPI traces over a tour sequence of interpolated nuisance projections
Figure 2 shows the traces representing the index values calculated across a tour between a pair of nuisance projections. The tour path is generated by interpolating between the two independent nuisance planes, i.e. from the projection onto \(x_1\)–\(x_2\) to one onto \(x_3\)–\(x_4\). The range of each axis is set to be the limits of the index, as might be expected over many different data sets, 0 to 1. Each projection in the interpolation will also be noise. Two different sample sizes are show, \(n=100\) as a dashed line, and \(n=1000\) as a solid line. The ideal trace is a smooth function, with relatively low values, and no difference between the sample sizes. A major feature to notice is that the scagnostics produce noisy functions, which is problematic, because small changes in the projection result in big jumps in the value. This will make them difficult to optimize. On the other hand holes, dcor2d, splines2d, MIC and TIC are relatively smooth functions.
Several of the indexes are sensitive to sample size also, the same structured projection with differing numbers of points, produces different values.
PPI traces over a tour sequence between nuisance and structured projections
Figure 3 shows the PPIs for a tour sequence between a nuisance and structured projection. A long sequence is generated where the path interpolates between projections onto \(x_1\)–\(x_2\), \(x_1\)–\(x_5\), \(x_5\)–\(x_6\), in order to see some of the intricacies of holes index. Sample size is indicated by line type: dashed being \(n=100\) and solid is \(n=1000\). The beginning of the sequence is the nuisance projection and the end is the structured projection. The index values for most PPIs increases substantially nearing the structured projection, indicating that they “see” the structure. Some indexes see all three structures: scagnostics, MIC and TIC, which means that they are flexible indexes capable of detecting a range of structure. Grimm (2016)’s indexes, dcor2d and splines2d, are excellent for detecting the sine, and they can see it from far away, indicated by the long slow increase in index value. The holes index easily detects the pipe, and can see it from a distance, but also has local maxima along the tour path. The scagnostic index, stringy, can see the structure but is myopic, only when it is very close. Interestingly the scagnostic, skinny, sees the spiral from a distance.
Optimization check with the guided tour
Before applying the new index functions, with the guided tour on real examples, we test them on the simulated dataset to understand the performance of the optimization. The guided tour combines optimization with interpolation between pairs of planes. Target planes of the path are chosen to maximize the PPI. There are three derivativefree optimization methods available in the guided tour: search_better_random (1), search_better (2), and search_geodesic (3). Method 1 casts a wide net randomlygenerating projection planes, computing the PPIs and keeping the best projection, and method 2 conducts a localized maximum search. Method 3 is quite different: a local search is conducted to determine a promising direction, and then this direction is followed until the maximum in that direction is found. For all methods the optimization is iterative, the best projections form target planes in the tour, the tour path is the interpolation to this target, and then a new search for a better projection is made, followed by the interpolation. For each projection during the interpolation steps, the PPI is recorded.
The stopping rule is that no better projections are found after a fixed number of tries, given a fixed tolerance value measuring difference. For method 1 and 2 two additional parameters control the optimization: the search window \(\alpha \), giving the maximum distance from the current plane in which projections are sampled, and the cooling factor, giving the incremental decrease in search window size. Method 3 in principle also has two free parameters, which are however fixed in the current implementation. The first is the small step size used when evaluating the most promising direction, it is fixed to 0.01, and the second parameter being the window over which the line search is performed, fixed to \(\pm \, \pi /4\) away from the current plane.
For distributions and indexes with smooth behavior and good squintability, method 3 is the most effective method for optimization. If these two criteria are not met the method may still be useful, but only given an informed starting projection. In such cases we can follow a method similar to that proposed by Friedman (1987): we break the optimization in two distinct steps. A first step (“scouting”) uses method 2 with large search window and no cooling as a way of stepping over fluctuations and local maxima and yielding an approximation of the global maximum. Note that this likely requires large number of tries, especially as dimension increases, since most randomly picked planes will not be interesting. The second step uses method 3 starting from the approximate maximum, which will take small steps to refine the result to be closer to the global maximum.
Looking down the pipe
Despite the simple structure, the pipe is relatively difficult for the PPIs to find. For the TIC index, there is a fairly small squint angle. For the holes index, there are several local maxima, that divert the optimizer. There is a hint of this from Fig. 3 because the initial projection (left side of trace) of purely noise variables has a higher index value than the linear combinations of noise and structured variables along the path. The uniform distribution was used to generate the noise variables, which has a higher PPI value than a normal distribution, yielding the higher initial value. In addition, a local maximum is observed whenever the pair of variables is one structured variable and one noise variable, because there is a lighter density in the center of the projection.
The optimization is done in two stages, a scouting phase using method 2, and a refinement stage using method 3. For the scouting we use \(\alpha = 0.5\) and stopping condition of maximum 5000 tries, and we optimized the TIC index.
Figure 4 shows the target projections (points) selected during the scouting with method 2 on the TIC index. The focus is on the target projections rather than the interpolation between them, because the optimization is done offline, and only the targets are used for the next step. The horizontal distance between the points in the plot reflects the relative geodesic distance between the planes in the 6D space. All of the other indexes are shown for interest. The TIC index value is generally low for this data, although it successfully detects the pipe. The holes, convex, skinny, and to some extent MIC, mirror the TIC performance. The holes differs in that it has some intermediate high values which are likely the indication of multimodality of this index on this data.
The final views obtained in each of the two stages are compared in the “Appendix”.
Finding sine waves
Given the patterns in Fig. 3 it would be expected that the sine could be found easily, using only optimization method 3 with the splines2d, dcor2d, MIC or TIC indexes. This is examined in Fig. 5. Optimization is conducted using the splines2d index, and the trace of the PPI over the optimization is shown, along with the PPI values for the other indexes over that path. The vertical blue lines indicate anchor bases, where the optimizer stops, and does a new search. The distance between anchor planes is smaller as the maximum is neared.
The only complications arise from a lack of rotation invariance of the splines2d index. It is not easily visible here, but it is possible that the best projection will have a higher PPI. The index changes depending on the basis used to define the plane, but the geodesic interpolation conducted by the tour uses any suitable basis to describe the plane, ignoring that which optimizes the PPI. This is discussed in Sect. 3.5.
Spiral detection
The spiral is the most challenging structure to detect because it has a small squint angle (Posse 1995b), especially as the ratio of noise to structure dimensions increases. This is explored using optimization method 2 to scout the space for approximate maxima. The skinny scagnostic index is used because it was observed (Fig. 3) to be sensitive to this structure, although the noisiness of the index might be problematic. The stringy appears to be more sensitive to the spiral, but it has a much smaller squint angle.
The search is conducted for \(p=4,5,6\) which would correspond to 2, 3 and 4 noise dimensions respectively. In addition we examine the distance between planes, using a Frobenius norm, as defined by Equation 2 of Buja et al. (2005), and available in the proj_dist function in the tourr package, to compare searches across dimensions. The distance between planes is related to squint angle, how far away from the ideal projection can the structure be glimpsed. We estimate the squint angle depending on the number of noise dimensions in the “Appendix”. In order for the optimizer to find the spiral, the distance between planes would need to be smaller than the squint angle. Figure 6 summarizes the results. When \(p=4\) the scouting method effectively finds the spiral. Plot (a) shows the sidebyside boxplots of pairwise distances between planes examined during the optimization, for \(p=4,5,6\). These are on average smaller for the lower dimension, and gradually increase as dimension increases. This is an indication of the extra computation needed to brute force find the spiral as noise dimensions increase. Plot (b) shows the distance of the plane in each iteration of the optimization to the ideal plane, where it can be seen that only when \(p=4\) does it converge to the ideal. Its likely that expanding the search space should result in uncovering the spiral in higher dimensions, which however requires tuning of the stopping conditions and long run times.
Rotational invariance or not
Rotational invariance is examined using the sine data (\(x_5\)–\(x_6\)), computing PPI for different rotations within the 2D plane, parameterized by angle. Results are shown in Fig. 7. Several indexes are invariant, holes, convex and MIC, because their value is constant around rotations. The dcor2d, splines2d and TIC index are clearly not rotationally invariant because the value changes depending on the rotation. The scagnostics indexes are approximately rotationally invariant, but particularly the skinny index has some random variation depending on rotation.
Speed
Examining the computing time as a function of sample size we find that scagnostics and splines2d are fast even for large samples, while all other index functions slow rapidly with increasing sample size. Detailed results are shown in the “Appendix”.
Parameter choices
Some PPIs have a choice of parameters, and the choice can have an effect on function smoothness, and sensitivity to structure. In the “Appendix” we examine the dependence of the scagnostics indexes on the binning, showing that even with small number of bins the indexes are noisy, while they lose ability to see structure. Sensitivity to the number of bins in the MIC index is also examined, showing that tuning the parameter can improve the final result.
Index enhancement
We identified two potential improvements. First, the issue of noisy index functions may be addressed via smoothing, and we explore different smoothing options for the examples of the skinny and stringy index in the “Appendix”. In addition, rotation dependent indexes may be enhanced by redefining them in a rotation invariant way.
Summary
Our results can be summarized by evaluating and comparing the advantages and disadvantages of each index function according to the criteria presented above. Such an overview is given in Table 3, listing if the criteria is fully met (\(\checkmark \)), there are some shortcomings (\(\cdot \)) or failure (\(\times \)). (The holes index does not appear in the summary because its performance understood, and is not being examined here.) We find that none of the indexes considered meet all criteria, and in particular rotation invariance is often not fulfilled. In addition the limited flexibility of most indexes highlights the importance of index selection in the projection pursuit setup. Table 3 further suggests that there is much room for the improvement of index functions detecting unusual association between model parameters.
Application to physics examples
This section describes the application of these projection pursuit indices to find twodimensional structure in two multidimensional gravitational waves problems.
The first example contains 2538 posterior samples obtained by fitting source parameters to the observed gravitational wave signal GW170817 from a neutron star merger (Abbott 2017). Data has been downloaded from LIGO (2018). The fitting procedures are described in detail in Abbott (2018). We consider six parameters of physical interest (6D) with some known relationships. Projection pursuit is used to find the known relationships.
The second example contains data generated from a simulation study of a binary black hole (BBH) merger event, as described in Smith et al. (2016). There are 12 parameters (12D), with multiple nuisance parameters. Projection pursuit uncovers new relationships between parameters.
Neutron star merger
A scatterplot matrix (with transparency) of the six parameters is shown in the “Appendix”. (In astrophysics, scatterplot matrices are often called “corner plots” (ForemanMackey 2016).) The diagonal shows a univariate density plot of each parameter, and the upper triangle of cells displays the correlation between variables. From this it can be seen that m1 and m2 are strongly, and slightly, nonlinearly associated. Between the other variables we observe some linear association (R1, R2), some nonlinear association (L1, L2, R1, R2), heteroskedastic variance in most variables and some bimodality (R1, L1, L2, m1, m2).
The model describes a neutron star merger and contains 6 free parameters, with each neutron star described by its mass \(m\) (m1, m2) and radius \(R\) (R1, R2), and a socalled tidal deformability parameter \(\Lambda \) (L1, L2) which is a function of the mass and radius, approximately proportional to \((m/R)^{5}\).
Data prepocessing
Because m1 and m2 are very strongly associated, m2 is dropped before doing PP. This relationship is obvious from the scatterplots of pairs of variables and does not need to be rediscovered by PP.
All variables are scaled to range between 0 and 1. The purpose is that range differences in individual variables should not affect the detection of relationships between multiple variables. Standardizing the range will still leave differences between the standard deviations of the variables, and for this problem this is preferred. Differences in the standard deviations can be important for keeping the nonlinear relationships visible to PP.
Applying PP
With only five parameters, a reasonable start is to examine the 5D space using a grand tour. This quickly shows the strong nonlinear relationships between the parameters. PP is then used to extract these relationships. The best index for this sort of problem is the splines2d, and it is fast to compute.
Figure 8 shows the optimal projection found by splines2d, a reconstructed view obtained by manually combining parameters, and a plot of the known relationship between parameters.
To further investigate relationships between parameters, \(L1\) is removed and PP with the splines2D is applied to the remaining four parameters. The dependence of \(L2\) on the mass and radius of the lighter neutron star, is revealed (Fig. 9 left plot). A manual reconstruction shows this is a relationship between L2, R1, R2 and m1 (middle plot), but it is effectively the known relationship between L2, R2 and m2 (right plot) – m2 is latently in the relationship though m1.
Black hole simulation
This data contains posterior samples from simulation from a model describing a binary black hole (BBH) merger event. There are twelve model parameters. Flat priors are used for most model parameters.
A scatterplot matrix, of nine of the twelve parameters, is shown in the “Appendix”. (Parameter m2 is not shown because it is strongly linearly associated with m1, phi\(\_\)jl and psi are not shown because they are uniform, and not associated with other parameters.) Among the nine plotted parameters, strong nonlinear relationships can be seen between the parameters ra, dec and time. The first two describe the position of the event in the sky, and time is the merging time (in GPS units). Because of the elliptical relationship between dec and time, the TIC index is used for PP, even though it is slow to compute. Between the other parameters, the main structure seen is multimodality and some skewness. These patterns are representative of the likelihood function, since most priors are flat, or built to capture growth with volume rather than distance.
Data preprocessing
The analysis is conducted on 11 of the twelve parameters. One variable is removed, m2, because it is so strongly associated with m1. All parameters are scaled into the range 0 to 1.
Applying PP
Exploring 11D with all PP indexes
All seven PP indexes are applied to the data. Figure 10 shows the projections that maximize three of the indexes. TIC and splines2d indexes identify very similar projections, that are based on the three parameters, dec, time and ra. This is to be expected based on the pairwise scatterplots. On the other hand, the 1convex index finds a very different view, but this is because the optimization doesn’t adequately reach a maximum for this index.
Exploring reduced space
The variables time, dec and ra are dropped from the data, and PP is applied to the remaining 8D space. Figure 11 shows the projections which maximize the TIC, splines2D and 1convex indices. The results provide similar information as already learned from the scatterplot matrix. The parameters chi\(\_\)tot and chi\(\_\)p are linearly related (TIC maxima), and theta\(\_\)jn has a bimodal distribution yielding the figure 8 shape found by the splines2d index. The 1convex index finds nothing interesting.
Effect of random starts, and subsets used
The initial conditions for the optimization, and the subset of variables used, can have a large effect on the projections returned. We illustrate this using only the splines2d index, and find that there is one more association that can be learned that was masked earlier.
Figure 12 shows six maxima obtained by different starts, for two types of parameters: first, spin related parameters (i.e. alpha, theta_jn, chi_tot and chi_p), and second position related parameters (i.e. ra, dec and distance). Four of the six (ad) are almost identical, but not interesting projections. Projection f has the highest PP index value but it is primarily the view seen in the bivariate plot of dec and ra. While none of these projections are particularly interesting on their own, moving between them can be revealing.
Choosing a different subset of variables reveals something new. The subspace of m1, ra, chi_tot, alpha, distance, dec produces a more refined view of Fig. 12 projection f. When alpha contributes in contrast to dec, the relationship between the points is almost perfectly on a curve. This is shown in Fig. 13. Manually reconstructing the optimal projection (left plot) can be done by differencing the two parameters, in their original units. This highlights the importance of improved optimization, that would use tiny final steps to polish the view to a finer optimal projection and possibly remove noise induced by small contributions of many variables.
Instructions for applying to new data
Applying these procedures to new datasets can be done using the guided tour available in the tourr package. The typical steps required are:

1.
Scale, standardize or sphere (principal components) the data.

2.
Index function selection matching the type of structure that is interesting to detect. Any new function can be used as long as it takes a matrix as input and returns a single index value.

3.
Call the guided tour with the data and index function:

For exploration this can be done via the tourr::animate function.

For recording the results tourr::save_history should be used.


4.
Explore how the results depend on choices made (index function, starting planes, optimization method, prior dimension reduction).
These are steps followed in the above two applications and are documented in the comments of the source code (Laa and Cook 2019a). For simple usage examples, see documentation of the tourr::guided_tour function.
Discussion
The motivation for this work was to discover dependencies between estimated parameters in multiple model fits in physics problems. This paper shows how projection pursuit with the new indexes can help address this problem. The results are encouraging, showing large potential for discovering unanticipated relations between multiple variables.
All of the indexes fall short against some aspect of the ideal properties of smoothness, squintability, flexibility, rotation invariance and speed. The paper describes how these properties can be assessed using tour methodology. Some potential fixes for the indexes are discussed but there is scope for further developing the new indexes. We recommend to use the spinebil (Laa and Cook 2019b) package when developing new indexes. It includes the functionalities needed to reproduce the assessments presented in this paper. While the current focus is on twodimensional index functions, indexes in the tourr package apply to arbitrary projection dimension, and the methodology introduced here could be applied to the assessment of index functions where \(d>2\).
The work also reveals inadequacies in the tour optimization algorithm, that may benefit from newly developed techniques and software tools. Exploring this area would help improve the guided tours. As new optimization techniques become available, adapting these to the guided tour would extend the technique to a broader range of problems. The current recommended approach is to first reduce the dimensionality, for example by using PCA, taking care to preserve nonlinear structure, prior to applying PP.
To apply the existing index functions in practice, we recommend to either use the tourr package directly, or if interaction is required to call the guided tour via the graphical interface available in the galahr (Laa and Cook 2019c) package. This package supersedes the now archived tourrGui (Huang et al. 2012). Both packages contain examples to show how the guided tour can be used with different index functions.
Supplementary material

This article was created with R Markdown (Xie et al. 2018), the code for the paper is available at (Laa and Cook 2019a).

Methods for testing new index functions as presented in this work are implemented in the R package spinebil (Laa and Cook 2019b).

The R package galahr (Laa and Cook 2019c) provides a graphical interface to the tourr package allowing for interactive exploration using the guided tour.

Additional explanations are available in the “Appendix”, covering details of

how the holes index was rescaled,

estimations of the squint angle,

a comparison of the computational performance of the index functions,

testing the effect of index parameters on the results and

suggestions how the index functions may be refined.

References
Abbott BP et al (2017) GW170817: observation of gravitational waves from a binary neutron star inspiral. Phys Rev Lett 119(16):161101
Abbott BP (2018) GW170817: measurements of neutron star radii and equation of state. Phys Rev Lett 121(16):161101
Ahn JS, Hofmann H, Cook D (2003) A projection pursuit method on the multidimensional squared contingency table. Comput Stat 18(3):605–26
Albanese D, Filosi M, Visintainer R, Riccadonna S, Jurman G, Furlanello C (2012) minerva and minepy: a C engine for the MINE suite and its R, Python and MATLAB wrappers. Bioinformatics 29(3):407–8
Asimov D (1985) The grand tour: a tool for viewing multidimensional data. SIAM J Sci Stat Comput 6(1):128–43
Buja A, Cook D, Asimov D, Hurley C (2005) Computational methods for highdimensional rotations in data visualization. In: Rao CR, Wegman EJ, Solka JL (eds) Handbook of statistics: data mining and visualization. Elsevier, New York, pp 391–413
Cook D, Swayne DF (2007) Interactive and dynamic graphics for data analysis with R and G gobi, 1st edn. Springer, Berlin
Cook D, Buja A, Cabrera J (1992) An analysis of polynomialbased projection pursuit. Comput Sci Stat 24:478–82
Cook D, Buja A, Cabrera J (1993) Projection pursuit indexes based on orthonormal function expansions. J Comput Gr Stat 2(3):225–50
Cook D, Buja A, Cabrera J, Hurley C (1995) Grand tour and projection pursuit. J Comput Gr Stat 4(3):155–72
Cook D, Laa U, Valencia G (2018) Dynamical projections for the visualization of PDFSense data. Eur Phys J C 78(9):742
Diaconis P, Freedman D (1984) Asymptotics of graphical projection pursuit. Ann Statist 12(3):793–815
Eddy WF (1977) A new convex hull algorithm for planar sets. ACM Trans Math Softw 3(4):398–403
Edelsbrunner H, Kirkpatrick D, Seidel R (1983) On the shape of a set of points in the plane. IEEE Trans Inf Theory 29(4):551–59
Ferraty F, Goia A, Salinelli E, Vieu P (2013) Functional projection pursuit regression. Test 22(2):293–320
ForemanMackey D (2016) Corner.py: scatterplot matrices in python. J Open Sour Softw 24
Friedman JH (1987) Exploratory projection pursuit. J Am Stat Assoc 82(1):249–66
Friedman JH, Tukey JW (1974) A projection pursuit algorithm for exploratory data analysis. IEEE Trans Comput 23:881–89
Grimm K (2016) Kennzahlenbasierte Grafikauswahl. Doctoral thesis, Universitat Augsburg
Grimm K (2017) Mbgraphic: measure based graphic selection. https://CRAN.Rproject.org/package=mbgraphic
Hall P (1989) On polynomialbased projection indices for exploratory projection pursuit. Ann Stat 17(2):589–605
Hofmann H, Wilkinson L, Wickham H, Lang DT, Anand A (2019) Binostics: compute scagnostics. https://cran.rproject.org/package=binostics
Hou S, Wentzell PD (2014) Recentered kurtosis as a projection pursuit index for multivariate data analysis. J Chemom 28(5):370–84
Huang B, Cook D, Wickham H (2012) TourrGui: a gWidgets gui for the tour to explore highdimensional data using lowdimensional projections. J Stat Softw 49(6):1–12
Huber PJ (1985) Projection pursuit. Ann Stat 13(2):435–75
Jones MC, Sibson R (1987) What is projection pursuit? J R Stat Soc Ser A 150:1–36
Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7(1):48–50
Kruskal JB (1969) Toward a practical method which helps uncover the structure of a set of observations by finding the line transformation which optimizes a new ‘index of condensation’. In: Milton RC, Nelder JA (eds) Statistical computation. Academic Press, New York, pp 427–40
Laa U, Cook D (2019a) https://github.com/uschiLaa/paperppi
Laa U, Cook D (2019b) https://github.com/uschiLaa/spinebil
Laa U, Cook D (2019c) https://github.com/uschiLaa/galahr
Lee EK, Cook D, Klinke S, Lumley T (2005) Projection pursuit for exploratory supervised classification. J Comput Gr Stat 14(4):831–46
LIGO (2018) https://dcc.ligo.org/public/0152/P1800115/005
Loperfido N (2018) Skewnessbased projection pursuit: a computational approach. Comput Stat Data Anal 120:42–57
Marsaglia G (1968) Random numbers fall mainly in the planes. Proc Natl Acad Sci 61:25
Naito K (1997) A generalized projection pursuit procedure and its significance level. Hiroshima Math J 27(3):513–54
Pan JX, Fung WK, Fang KT (2000) Multiple outlier detection in multivariate data using projection pursuit techniques. J Stat Plann Inference 83(1):153–67
Pilhöfer A, Unwin A (2013) New approaches in visualization of categorical data: R package extracat. J Stat Softw 53(7):1–25
Posse C (1995a) Projection pursuit exploratory data analysis. Comput Stat Data Anal 20(6):669–87
Posse C (1995b) Tools for twodimensional exploratory projection pursuit. J Comput Gr Stat 4(2):83–100
R Core Team (2018) R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna. https://www.Rproject.org/
Reshef DN, Reshef YA, Finucane HK, Grossman SR, McVean G, Turnbaugh PJ, Lander ES, Mitzenmacher M, Sabeti PC (2011) Detecting novel associations in large data sets. Science 334(6062):1518–24
Reshef YA, Reshef DN, Finucane HK, Sabeti PC, Mitzenmacher M (2016) Measuring dependence powerfully and equitably. J Mach Learn Res 17(212):1–63
RodriguezMartinez E, Goulermas JY, Mu T, Ralph JF (2010) Automatic induction of projection pursuit indices. IEEE Trans Neural Netw 21(8):1281–95
Simon N, Tibshirani R (2014) Comment on ‘detecting novel associations in large data sets’ by Reshef Et Al, Science Dec 16, 2011. arXiv EPrints arXiv:1401.7645. http://arxiv.org/abs/1401.7645
Smith R, Field SE, Blackburn K, Haster CJ, Pürrer M, Raymond V, Schmidt P (2016) Fast and accurate inference on gravitational waves from precessing compact binaries. Phys Rev D 94(4):044031
Székely GJ, Rizzo ML, Bakirov NK (2007) Measuring and testing dependence by correlation of distances. Ann Stat 35(6):2769–94
Tukey PA, Tukey JW (1981) Graphical display of data in three and higher dimensions. Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics. Wiley, New York
Wahba G (1990) Spline models for observational data. In: CBMSNsf regional conference series in applied mathematics. Society for Industrial Applied Mathematics, Philadelphia
Wickham H, Cook D, Hofmann H, Buja A (2011) Tourr: an R package for exploring multivariate data with projections. J Stat Softw 40(2):1–18
Wilkinson L, Wills G (2008) Scagnostics distributions. J Comput Gr Stat 17(2):473–91
Wilkinson L, Anand A, Grossman R (2005) Graphtheoretic scagnostics. In: IEEE symposium on information visualization, 2005. INFOVIS 2005, pp 157–64
Wood SN, Pya N, Säfken B (2016) Smoothing parameter and model selection for general smooth models (with discussion). J Am Stat Assoc 111:1548–75
Xie Y (2015) Dynamic documents with R and knitr. 2nd ed. Chapman, Boca Raton, FL. https://yihui.name/knitr/
Xie Y (2016) Bookdown: authoring books and technical documents with R markdown. Chapman, Boca Raton, FL. https://github.com/rstudio/bookdown
Xie Y, Allaire JJ, Grolemund G (2018) R markdown: the definitive guide. Chapman, Boca Raton, FL. https://bookdown.org/yihui/rmarkdown
Acknowledgements
The authors gratefully acknowledge the support of the Australian Research Council. We thank Rory Smith for help with the gravitational wave examples, and German Valencia for useful comments. This article was created with knitr (Xie 2015), R Markdown (Xie et al. 2018) and bookdown (Xie 2016) with embedded code.
Author information
Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix
Rescaling of holes index
Holes and cmass indexes are derived from \(I_0^N\) of Cook et al. (1993). As noted in proposition 1 of that paper the index takes local maxima for the minimum and maximum of \(a_0\) which are achieved by central hole and central mass distributions respectively. Cook and Swayne (2007) then gives explicit index functions defined for sphered data (zero mean, identity variancecovariance matrix). They are defined such that each one is maximized for central holes or central mass type distributions, with maximum=1, and cmass=1holes. It follows that for either index both large and small values signal deviation from the normal distribution, and given a normal distribution we expect to find “average” index values rather than values close to zero.
We can estimate the values found for normal distribution by comparing values of \(a_{00}\) of Sec 7.1 in Cook et al. (1993). The maximum value is \(1/(2\pi )\) found for cmass type distributions, the minimum is \(1/(2\pi e)\) found for hole type distributions. Evaluating for normal distributions gives \(1/(4\pi )\), rescaling such that the index values range from 0 to 1 then puts the value for normal distributions at approximately \(0.2\). This is consistent with the results we found, i.e. for normal distributions the cmass index is about \(0.2\), and the holes index (=1cmass) is about \(0.8\).
We therefore rescale as follows: first have cutoff at the respective value for the normal distribution, i.e. any value below 0.2 (0.8) is set to zero for cmass (holes) index, and we rescale the remaining range to be between zero and one.
Estimating the squint angle of the spiral
We estimate the squint angle of the spiral (for p = 4, 5, 6) as follows. First pick a random starting plane and generate a tour path from the starting plane to the ideal plane containing the spiral. Using skinny as the reference index we fix a lower index value that is attributed to indicate squintability at \(0.6\), and we move along the tour path towards the ideal plane until this value is reached. The distance between the thus identified plane and the ideal plane is used as an estimate of the squint angle in this direction. Since this will strongly depend on the random starting plane, i.e. the considered direction, we repeat the estimation 100 times and present the results in the form of a box plot in Fig. 14. The result shows a large drop in squint angle when going from p = 4 to higher dimensions, and generally a large spread of squint angles depending on the direction.
Computational performance
Computational time is important for using the PPIs with the guided tour, online. Figure 15 summarizes performance for each PPI. For simplicity, data with sample sizes ranging from 100 to 10,000 are drawn from a 6d solid sphere, using the geozoo package (Schloerke 2016). The time to compute the PPIs over 100 interpolated grand tour projections is recorded. The scagnostics PPI are computed as a bundle, since this is the code base, and that major computational constraint is common to all the scagnostics. There are two versions of the MIC and TIC algorithm, labelled MINE and MINE E, the second being a newer algorithm which improves their computational performance.
The results are interesting. The scagnostic indexes and splines2d are very fast regardless of sample size. MIC, TIC (both versions) and dcor2d slow rapidly as sample size increases.
Effect of parameter choice in index value
Some parameters must be provided for some PPIs. This can be advantageous, allowing the index to more flexibly work for different types of structure, controlling tradeoffs between noise and fine structure detection, and affecting computing time and precision.

Binning:

Scagnostics: the number of bins can be controlled by the user, note however that internally the implementation will reduce the number of bins if too many nonempty bins are found (more than 250).

MINE: the maximum number of bins considered is fixed by the user as a function of the number of data points. The default is chosen as a tradeoff between resolution and noise dependence, but it may be tuned based on requirements dictated by specific datasets. Apart from sensitivity to noise computing time may also be a consideration here.


Spline knots: for the splines2d measure we need to fix the number of knots. By default it is fixed to be 10 (or lower if appropriate based on the data values). In our examples we find the number to be appropriate to identify functional dependence while rejecting noise, but some distributions may require tuning of this parameter.
The bins argument for the scagnostics might be reasonably expected to affect the smoothness of the index: a small number of bins should provide a smooth index function, but may affect its ability to detect fine structure. Figure 16 examines this. Scagnostics PPIs are computed for the spiral1000 data on a tour path between \(x_1\)–\(x_2\) to \(x_5\)–\(x_6\), for number of bins equal to 10, 20, 50. The interesting observation to make is that even with small bin size the functions are all relatively noisy. The problem with the small bin size is that the spiral becomes invisible to the PPI.
Binning sensitivity of MIC index
To examine the sensitivity of binning in the MIC PPI, the classic RANDU data (Marsaglia 1968), available in R, is used. Binning is defined by \(\delta \), where \(B(n) = n^{\delta }\). Figure 17 shows the best projection, index value and computing time obtained when optimizing the MIC index with values \(\delta = 0.6, 0.7, 0.8\). With small \(\delta \), less bins, the structure isn’t visible, and with larger \(\delta \) the structure is confounded with noise. It does appear that this parameter affects the performance of the MIC index.
Ways to refine the PPIs
The biggest issues revealed by the investigation into the new PPIs are a lack of smoothness, particularly for the scagnostics indexes, and the rotation invariance of Grimm’s indexes. To fix the smoothness of an index function, it is possible to calculate the PPI for a small neighborhood of projections and average the value, or alternatively average the PPI for several jittered projections. This is investigated in Fig. 18. Rotation invariance is more difficult to fix, but an alternative tour interpolation method could be useful. The geodesic interpolation transitions between planes, and it ignores the basis defining the plane, creating a problem with rotation invariant indices. Alternative interpolations based on Givens or Householder rotations could be implemented to transition between bases, which should alleviate the need for rotationally invariant indices.
Two different methods are considered for smoothing the index values:

Jittering points: using the jitter function we move each point by a random amount drawn from a uniform distribution between \(\pm \,\beta \).

Jittering angles: using the tourr implementation we can draw a random plane and move some small amount \(\epsilon \) in that direction.
The mean value from a sample of projections is recorded as the PPI value. This could be robsitufied by dropping the most extreme values.
This is particularly interesting for the scagnostics indexes skinny and stringy which we found to be most noisy among the indexes considered. Figure 18 studies the potential of these two smoothing approaches, using the tour path between noise variables of the spiral1000 dataset and different \(\epsilon \) and \(\beta \) values. Both methods appear to be promising in smoothing the function. Because the scagnostics are fast to compute, either of these methods is feasible. For this example we have smoothed over 10 randomly selected jittered views, computing time increases linearly with the number of randomly jittered views, as this is mostly determined by the time needed to evaluate the scagnostics indexes which is done separately for each view.
Additional figures
Final projection of pipe guided tour
Figure 19 shows the projection returned during the scouting phase (left) and the refinement phase (right). It was important to start the method 3 optimizer at the best projection returned during the scouting phase, to smoothly converge more closely to the ideal projection.
Dataset overview scatter plot matrices
Figures 20 and 21 show the scatter plot matrices of the gravitational wave datasets considered.
Rights and permissions
About this article
Cite this article
Laa, U., Cook, D. Using tours to visually investigate properties of new projection pursuit indexes with application to problems in physics. Comput Stat 35, 1171–1205 (2020). https://doi.org/10.1007/s00180020009548
Received:
Accepted:
Published:
Issue Date:
Keywords
 Scagnostics
 Statistical graphics
 Data visualisation
 Exploratory data analysis
 Data science
 Guided tour