RESULT AND ANALYSIS

6. RESULT AND ANALYSIS
6.1 OUTPUT EXECUTION
Executing a sample of The FP Growth method gives the following output :
Input :
1 3 4
2 4 5
2 4 6
Output :
Number of frequent sets = 17
[1] {4} = 3
[2] {2} = 2
[2.1] {2 4} = 2
[3] {1} = 1
[3.1] {1 4} = 1
[4] {3} = 1
[4.1] {3 4} = 1
[4.2] {3 1} = 1
[4.2.1] {3 1 4} = 1
[5] {5} = 1
[5.1] {5 4} = 1
[5.2] {5 2} = 1
[5.2.1] {5 2 4} = 1
[6] {6} = 1
[6.1] {6 4} = 1
[6.2] {6 2} = 1
[6.2.1] {6 2 4} = 1
T-tree Storage = 272 (Bytes)
Executing a sample of The Apriori method gives the following output :

Input :
1 3 4
2 4 5
2 4 6

Output :
[1] {1} = 1
[2] {2} = 2
[3] {3} = 1
[3.1] {3 1} = 1
[4] {4} = 3
[4.1] {4 1} = 1
[4.2] {4 2} = 2
[4.3] {4 3} = 1
[4.3.1] {4 3 1} = 1
[5] {5} = 1
[5.1] {5 2} = 1
[5.2] {5 4} = 1
[5.2.1] {5 4 2} = 1
[6] {6} = 1
[6.1] {6 2} = 1
[6.2] {6 4} = 1
[6.2.1] {6 4 2} = 1
T-tree Storage = 296 (Bytes)