An Incremental High-Utility Mining Algorithm with Transaction Insertion

Algorithm 3

Pseudocode of merge-list function.

INPUT:  DB.UL is the utility-list of ;

     db.UL is the utility-list of ;

     .UL is the utility-list of ;

OUTPUT: .UL.

BEGIN Procedure

  /^*.UL is the utility-list of , .UL^*/

  /^* is the element of .UL^*/

(1) .UL = null, .UL = null.

(2) FOR each itemset and ..UL DO

(3)  IF   .UL   null  THEN

(4)   search itemset .UL in db.UL

(5)   IF   (.UL and .UL) THEN

(6)     FOR each element .UL and ..UL DO

(7)      .Iutility.sum .Iutility.sum + .Iutility;

(8)      .Rutility.sum .Rutility.sum + .Rutility;

(9)      ..

(10)    END FOR

(11)   END IF

(12)   .UL .UL.

(13)  END IF

(14) END FOR

(15) RETURN   .UL.

END Procedure