

A Fast Updated High Utility Pattern Trees for Transaction Deletion
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.
Keywords
high utility pattern tree; decremental; transaction deletion; high utility mining; dynamic database
Citation Format:
Jerry Chun-Wei Lin, Guo-Cheng Lan, Tzung-Pei Hong, Yueh-Yun Wang, "A Fast Updated High Utility Pattern Trees for Transaction Deletion," Journal of Internet Technology, vol. 16, no. 1 , pp. 131-138, Jan. 2015.
Jerry Chun-Wei Lin, Guo-Cheng Lan, Tzung-Pei Hong, Yueh-Yun Wang, "A Fast Updated High Utility Pattern Trees for Transaction Deletion," Journal of Internet Technology, vol. 16, no. 1 , pp. 131-138, Jan. 2015.
Refbacks
- There are currently no refbacks.
Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Office of Library and Information Services, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 974301, Taiwan, R.O.C.
Tel: +886-3-931-7314 E-mail: jit.editorial@gmail.com