Research Article
Efficient Utility Tree-Based Algorithm to Mine High Utility Patterns Having Strong Correlation
| | Input: Database , , and . | | | Output: All Correlated High Utility Itemsets. | | (1) | Scan to obtain the revised database ; | | (2) | the set of unique items in sorted on their support descending order; | | (3) | Execute the Algorithm 1 to construct for the ; | | (4) | while not NULL do | | (5) | the last item in ; | | (6) | from the header table of the follow the of the nodes labeled to construct the ; | | (7) | ifthen | | (8) | | | (9) | end if | | (10) | ifthen | | (11) | Call search (, , , ) | | (12) | end if | | (13) | - | | (14) | end while | | (15) | return |
|
