Correlation Distance Matrix#
Given \(n\) feature vectors \(x_1 = (x_{11}, \ldots, x_{1p}), \ldots x_n = (x_{n1}, \ldots, x_{np})\) of dimension \(p\), the problem is to compute the symmetric \(n \times n\) matrix \(D_{\text{cor}} = (d_{ij})\) of distances between feature vectors, where
Batch Processing#
Algorithm Input#
The correlation distance matrix algorithm accepts the input described below.
Pass the Input ID as a parameter to the methods that provide input for your algorithm.
For more details, see Algorithms.
Input ID |
Input |
|---|---|
|
Pointer to the \(n \times p\) numeric table for which the distance is computed. The input can be an object of any class derived from |
Algorithm Parameters#
The correlation distance matrix algorithm has the following parameters:
Parameter |
Default Value |
Description |
|---|---|---|
|
|
The floating-point type that the algorithm uses for intermediate computations. Can be |
|
|
Performance-oriented computation method, the only method supported by the algorithm. |
Algorithm Output#
The correlation distance matrix algorithm calculates the result described below.
Pass the Result ID as a parameter to the methods that access the results of your algorithm.
For more details, see Algorithms.
Result ID |
Result |
|---|---|
|
Pointer to the numeric table that represents the \(n \times n\) symmetric distance matrix \(D_\text{cor}\). By default, the result is an object of the |
Examples#
Batch Processing:
Batch Processing:
Performance Considerations#
To get the best overall performance when computing the correlation distance matrix:
If input data is homogeneous, provide the input data and store results in homogeneous numeric tables of the same type as specified in the
algorithmFPTypeclass template parameter.If input data is non-homogeneous, use AOS layout rather than SOA layout.
Product and Performance Information |
|---|
Performance varies by use, configuration and other factors. Learn more at www.Intel.com/PerformanceIndex. Notice revision #20201201 |