Distributed Processing¶
This mode assumes that the data set is split into nblocks
blocks across computation nodes.
Algorithm Parameters¶
The low order moments algorithm in the distributed processing mode has the following parameters:
Parameter |
Default Valude |
Description |
---|---|---|
|
Not applicable |
The parameter required to initialize the algorithm. Can be:
|
|
|
The floating-point type that the algorithm uses for intermediate computations. Can be |
|
|
Available methods for computation of low order moments:
|
|
|
Estimates to be computed by the algorithm:
|
Computation of low order moments follows the general schema described in Algorithms:
Step 1 - on Local Nodes¶
In this step, the low order moments 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 numeric table of size \(n_i \times p\) that represents the \(i\)-th data block on the local node. While the input for |
In this step, the low order moments algorithm calculates the results 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 \(1 \times 1\) numeric table that contains the number of observations processed so far on the local node. By default, this result is an object of the |
Partial characteristics computed so far on the local node, each in a \(1 \times p\) numeric table.
By default, each table is an object of the HomogenNumericTable
class, but you can define the tables as objects
of any class derived from NumericTable
except PackedSymmetricMatrix
, PackedTriangularMatrix
, and CSRNumericTable
.
Result ID |
Result |
---|---|
|
Partial minimums |
|
Partial maximums |
|
Partial sums |
|
Partial sums of squares |
|
Partial sums of squared differences from the means |
Step 2 - on Master Node¶
In this step, the low order moments 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 |
---|---|
|
A collection that contains numeric tables with partial results computed in Step 1 on local nodes (six numeric tables from each local node).
These numeric tables can be objects of any class derived from the |
In this step, the low order moments algorithm calculates the results described in the following table.
Pass the Result ID
as a parameter to the methods that access the results of your algorithm.
For more details, see Algorithms.
Note
Each result is a pointer to the \(1 \times p\) numeric table that contains characteristics for each feature in the data set.
By default, the tables are objects of the HomogenNumericTable
class,
but you can define each table as an object of any class derived from NumericTable
except PackedSymmetricMatrix
, PackedTriangularMatrix
, and CSRNumericTable
.
Result ID |
Characteristic |
---|---|
|
Minimums |
|
Maximums |
|
Sums |
|
Sums of squares |
|
Sums of squared differences from the means |
|
Estimates for the means |
|
Estimates for the second order raw moments |
|
Estimates for the variances |
|
Estimates for the standard deviations |
|
Estimates for the variations |
Product and Performance Information |
---|
Performance varies by use, configuration and other factors. Learn more at www.Intel.com/PerformanceIndex. Notice revision #20201201 |