A single‐phase algorithm for mining high utility itemsets using compressed tree structures. Issue 6 (12th November 2021)

• Record Type: Journal Article
• Authors: Bhat B, Anup; SV, Harish; M, Geetha
• Is Part Of: ETRI journal. Volume 43:Issue 6(2021)
• Page Start: 1024
• Page End: 1037
• Publication Date: 2021-11-12
• Subjects: data mining -- high utility itemsets -- utility mining; Telecommunication -- Periodicals; Electronics -- Periodicals; Electronics; Telecommunication; Periodicals; Periodicals; 621.38205
• DOI: 10.4218/etrij.2020-0300
• Languages: English
• ISSNs: 1225-6463

Abstract

Abstract: Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two‐phase tree‐based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern‐growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single‐phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP‐Growth, and UP‐Growth+ algorithms.