Research Article

An Incremental High-Utility Mining Algorithm with Transaction Insertion

Algorithm 2

Pseudocode of the proposed HUI-list-INS algorithm.
INPUT:  , the original database;
    , the incremental database;
    ptable, the profit table;
    , the minimum utility threshold;
    EUCS, the estimated utility co-occurrence structure;
    ., the utility list of ;
    ., the utility list of ;
    ., the utility list of ;
    ., the utility list of itemset ;
    , the set of utility list of all ’s 1-extensions;
    , the extension of .
OUTPUT: High-utility itemsets.
BEGIN Procedure
(1) . = null, . = null, . = null, . = null.
(2) FOR each in   DO
(3)   FOR each in   DO
(4)   .UL , Iutility, ;
(5)   EUCS , .
(6)   END FOR
(7) END FOR
(8) DB.U..
(9) FOR each in d DO
(10)  FOR each in   DO
(11)   .UL , Iutility, ;
(12)   update the TWU() in EUCS.
(13)  END FOR
(14) END FOR
(15) ...
(16) call merge-list(DB.UL, db.UL, U.UL).
(17) FOR each in .UL DO
(18)  IF   .Iutility.sum ×  THEN
(19)   HUIs .
(20)  END IF
(21)  IF   .Iutility.sum + .Rutility.sum ×  THEN
(22)   extULs   null.
(23)   FOR each after in .UL DO
(24)    IF   TWU() and TWU() ≥ ×     THEN
(25)     extULs + Construct(.UL, , TWU()).
(26)    END IF
(27)   END FOR
(28)   call HUI-list-INS(X, extULs,  ).
(29)  END IF
(30) END FOR
END Procedure