5:19 PM

TOTAL SUPPORT TREE

3.2.5 TOTAL SUPPORT TREE

A T-tree is a tree structure which is used to store frequent item set information. The patterns are stored here. Levels in each sub-branch of the tree are defined using arrays.

The tree is built in "reverse". Each branch is founded on the last element of the frequent sets to be stored. Given a data set of the form:
{1 3 4}
{2 4 5}
{2 4 6}

and assuming a support count of less than 1, we can identify the following frequent sets (support counts in parenthesis):

1 (1) 1 3 (1) 1 3 4 (1)
2 (2) 1 4 (1) 2 4 5 (1)
3 (1) 2 4 (2) 2 4 6 (1)
4 (3) 2 5 (1)
5 (1) 2 6 (1)
6 (1) 3 4 (1)
4 5 (1)
4 6 (1)

These can be presented in a T-tree. The storage required for each node (representing a frequent set) in the T-tree is then 12 Bytes:

Fig 3.3 Total Support Tree

Reference to T-tree node structure (4 Bytes)
Support count field in T-tree node structure (4 Bytes)
Reference to child array field in T-tree node structure (4 Bytes)

3.3 REQUIREMENTS

3.3.1 SOFTWARE REQUIREMENTS
Language Java
Platform Platform Independent



Table 3.1 Software Requirements



3.3.2 HARDWARE REQUIREMENTS
Processor 1.8 GHz processor
RAM 256 MB
Hard Disk Space 40 GB





Table 3.2 Hardware Requirements

0 comments: