Pointer to the numeric table t with the mining data. Each row consists of two integers:
The input can be an object of any class derived from NumericTable except PackedTriangularMatrix and PackedSymmetricMatrix.
The floating-point type that the algorithm uses for intermediate computations. Can be
The computation method used by the algorithm. The only method supported so far is Apriori.
Minimal support, a number in the [0,1) interval.
Minimal confidence, a number in the [0,1) interval.
The total number of unique items. If set to zero, the library automatically determines the number of unique items from the input data.
The total number of transactions. If set to zero, the library automatically determines the number transactions from the input data.
A flag that enables generation of the rules from large item sets.
The sort order of returned item sets:
The sort order of returned rules:
A parameter that defines the minimal size of item sets to be included into the array of results. The value of zero imposes no limitations on the minimal size of item sets.
A parameter that defines the maximal size of item sets to be included into the array of results. The value of zero imposes no limitations on the maximal size of item sets.
Pointer to the numeric table with large item sets. The number of rows in the table equals the number of items in the large item sets. Each row contains two integers:
Pointer to the numeric table of support values. Each row contains two integers:
Pointer to the numeric table that contains the left-hand-side (X) part of the association rules. Each row contains two integers:
Pointer to the numeric table that contains the right-hand-side (Y) part of the association rules. Each row contains two integers:
Pointer to the numeric table that contains confidence values of rules, floating-point numbers between 0 and 1. Confidence value in the i-th position corresponds to the rule with the index i.
- The library requires transactions and items for each transaction to be passed in the ascending order.
- Numbering of rules starts at 0.
- The library calculates the sizes of numeric tables intended for results in a call to the algorithm. Avoid allocating the memory in numeric tables intended for results because, in general, it is impossible to accurately estimate the required memory size. If the memory interfaced by the numeric tables is allocated and its amount is insufficient to store the results, the algorithm returns an error.
- A SOA numeric table of type int to store features.
- A homogenous numeric table of type int to store large item sets, support values, and left-hand-side and right-hand-side parts of association rules.
- A numeric table with the confidence values of the same data type as specified in the algorithmFPType template parameter of the class.
Intel’s compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instruction sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserved for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice.
Notice revision #20110804