Bhat, Anup B and Harish, S V and Geetha, M (2021) A single-phase algorithm for mining high utility itemsets using compressed tree structures. ETRI Journal, 43 (6). pp. 1024-1037. ISSN 1225-6463

PDF 14040.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

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 proce�dure 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 strate�gies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP�Growth+ algorithms

Actions (login required)

View Item