European Proceedings Logo

Algorithms And Data Structures For Association Rule Mining And Its Complexity Analysis

Table 1:

Apriori FP-Growth Matrix SimpleARM Using Matrix Quadrants Using the transposition of transaction table
Used data structure List Tree Binary Matrix 6 Matrices and Arrays Matrix and List Matrix and List
The time complexity of one iteration of the transaction pass O C t m a x k m a x O m O m O t m a x O 2 t m a x O t m a x
The space complexity O C m k m a x O C m k m a x O n O n O n O n
Count of passes k m a x 2 1 ( k m a x + 1 ) 1 ( k m a x + 1 if k m a x > 3 ) > 1 > 1
Distributed mining capability No No Yes Yes Yes Yes
< Back to article