Abstract

Utility mining was proposed as an extension of frequent-itemset mining for concerning various factors from users. In this paper, a fast-updated high-utility-pattern trees for transaction deletion (FUHUP-DEL) algorithm is proposed to handle transaction deletion for efficiently updating discovered high utility itemsets in decremental mining. The HUP-tree structure is adopted in the proposed algorithm for reducing the computations of re-scan database in a level-wise way. Experiments show that the proposed FUHUP-DEL algorithm outperforms the batch two-phase approach.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call