Science & Engineering Research Support soCiety (SERSC)
Frequent Pattern Tree (FP-Tree) is one of the famous data structure to keep frequent itemsets. However when the content of transactional database is modified, FP-Tree must be reconstructed again due to the changes in patterns and items support. Until this recent, most of the techniques in frequent pattern mining are using the original database to determine the items support and not from their recommended trees data structure. Therefore in this paper, the authors proposed a technique called Fast Determination of Item Support Technique (F-DIST) to capture the items support from their suggested DisOrder Support Trie ITemset (DOSTrieIT) data structure.