Research Article
Efficient Utility Tree-Based Algorithm to Mine High Utility Patterns Having Strong Correlation
Algorithm 1
Algorithm for constructing UTtree.
| Input: The revised Database RD | | Output: The UTtree | | Initialization: Create Root node to initialize the tree | (1) | for each transaction in do | (2) | Items of | (3) | Call insertTree | (4) | end for | (5) | return | | Function: insertTree | (1) | | (2) | if has child such that then | (3) | Update the of | (4) | else | (5) | Create new node for the | (6) | | (7) | points to the nodes whose label is | (8) | | (9) | if is not null then | (10) | Call insertTree | (11) | end if | (12) | end if |
|