Research Article
An Incremental High-Utility Mining Algorithm with Transaction Insertion
Algorithm 1
Pseudocode of utility-list structures construction algorithm.
INPUT: An itemset ; | . is the utility-list of ; | ., .., , and , . | OUTPUT: .. | BEGIN Procedure | (1) . = null. | (2) FOR each element DO | (3) IF . and .TID .TID THEN | (4) IF . null THEN | (5) Search element . that .TID = .TID; | (6) .TID, .Iutility + .Iutility − E.Iutility, .. | (7) ELSE | (8) .TID, .Iutility + .Iutility, .. | (9) END IF | (10) . . | (11) END IF | (12) END FOR | (13) RETURN .. | END Procedure |
|