SAP HANA Predictive Analysis Library (PAL)

3.4.2 FP-Growth
FP-Growth is an algorithm to find frequent patterns from transactions without generating a candidate itemset.
In PAL, the FP-Growth algorithm is extended to find association rules in three steps:
1. Converts the transactions into a compressed frequent pattern tree (FP-Tree);
2. Recursively finds frequent patterns from the FP-Tree;
3. Generates association rules based on the frequent patterns found in Step 2.
FP-Growth with relational output is also supported.
Prerequisites
●
●
The input data does not contain null value.
There are no duplicated items in each transaction.
FPGROWTH
This function reads input transaction data and generates association rules by the FP-Growth algorithm.
Procedure Generation
CALL SYS.AFLLANG_WRAPPER_PROCEDURE_CREATE (‘AFLPAL’, ‘FPGROWTH’,
‘’, '', );
The signature table should contain the following records:
Table 232:
Position Schema Name Table Type Name Parameter Type
1 IN
2 IN
3
OUT
Procedure Calling
CALL .(, , ) with overview;
The procedure name is the same as specified in the procedure generation.
The input, parameter, and output tables must be of the types specified in the signature table.
Signature
Input Table
304 P U B L I C
SAP HANA Predictive Analysis Library (PAL)
PAL Functions