Efficient updating of discovered high-utility itemsets for transaction deletion in dynamic databases. Issue 1 (January 2015)

• Record Type: Journal Article
• Authors: Lin, Chun-Wei; Hong, Tzung-Pei; Lan, Guo-Cheng; Wong, Jia-Wei; Lin, Wen-Yang
• Is Part Of: Advanced engineering informatics. Volume 29:Issue 1(2015:Jan.)
• Page Start: 16
• Page End: 27
• Publication Date: 2015-01
• Subjects: Computer-aided engineering -- Periodicals; Engineering -- Data processing -- Periodicals; 620.00285
• DOI: 10.1016/j.aei.2014.08.003
• Languages: English
• ISSNs: 1474-0346

Abstract

<abstract xml:lang="en" abstract-type="author" id="ab005"> <title id="st080">Abstract</title> <sec> <p id="sp0005">Most algorithms related to association rule mining are designed to discover frequent itemsets from a binary database. Other factors such as profit, cost, or quantity are not concerned in binary databases. Utility mining was thus proposed to measure the utility values of purchased items for finding high-utility itemsets from a static database. In real-world applications, transactions are changed whether insertion or deletion in a dynamic database. An existing maintenance approach for handling high-utility itemsets in dynamic databases with transaction deletion must rescan the database when necessary. In this paper, an efficient algorithm, called PRE-HUI-DEL, for updating high-utility itemsets based on the pre-large concept for transaction deletion is proposed. The pre-large concept is used to partition transaction-weighted utilization itemsets into three sets with nine cases according to whether they have large (high), pre-large, or small transaction-weighted utilization in the original database and in the deleted transactions. Specific procedures are then applied to each case for maintaining and updating the discovered high-utility itemsets. Experimental results show that the proposed PRE-HUI-DEL algorithm outperforms a batch two-phase algorithm and a FUP2-based algorithm in maintaining high-utility itemsets.</p> </sec> </abstract>