timeSequence

Index evaluation timing may depend on the data distribution, we
evaluate the computing time for a set of different projections to
get an overview of the distribution of computing times.

Projection pursuit is used to find interesting low-dimensional
projections of high-dimensional data by optimizing an index over all
possible projections. The 'spinebil' package contains methods to evaluate
the performance of projection pursuit index functions using tour methods.
A paper describing the methods can be found at <doi:10.1007/s00180-020-00954-8>.

Tina Rashid Jafari

spinebil

Investigating New Projection Pursuit Index Functions

Ursula Laa

Dianne Cook

timeSequence function

<dl><dt>d</dt>
<dd>Input data in matrix format</dd>
<dt>t</dt>
<dd>List of projection matrices (e.g. interpolated tour path)</dd>
<dt>idx</dt>
<dd>Index function</dd>
<dt>pmax</dt>
<dd>Maximum number of projections to evaluate (cut t if longer than pmax)</dd></dl>

Arguments

Time each index evaluation for projections in the tour path. — timeSequence

<dl>

<dt>d</dt>
<dd>Input data in matrix format</dd>


<dt>t</dt>
<dd>List of projection matrices (e.g. interpolated tour path)</dd>


<dt>idx</dt>
<dd>Index function</dd>


<dt>pmax</dt>
<dd>Maximum number of projections to evaluate (cut t if longer than pmax)</dd>

</dl>

timeSequence: Time each index evaluation for projections in the tour path.

Description

Usage

Value

Arguments

Examples