Improved Strategy for High-Utility Pattern Mining Algorithm

Algorithm 1

The EFIM algorithm.

	Input: D: a transaction database; MinU: a user-specified threshold.
Output: the set of high-utility itemsets
(1)	α = ∅
(2)	Calculate lu (α,i) for all items i ∈ I by scanning D, using a utility-binary;
(3)	Secondary(α) = {i|i ∈ I∧lu (α,i) ≥MinU };
(4)	Let be the total order of TWU ascending values on Secondary(α);
(5)	Scan D to remove each item iSecondary(α) from the transactions, sort items in each transaction according to, and delete empty transactions;
(6)	Sort transactions in D according toT;
(7)	Calculate the subtree utility su(α,i) of each item i ∈ Secondary(α) by scanning D, using a utility-bin array;
(8)	Primary(α) = {i|i ∈ Secondary(α)∧su(α,i)≥MinU};
(9)	Search (α, D, Primary(α), Secondary(α), MinU);