Title: An efficient strategy for mining high utility itemsets

Authors: Bac Le, Huy Nguyen, Bay Vo

Addresses: Faculty of Information Technology, University of Science, 227 Nguyen Van Cu, District 5, Ho Chi Minh City, Vietnam. ' Faculty of Information Technology, Saigon University, 273 An Duong Vuong, District 5, Ho Chi Minh City, Vietnam. ' Faculty of Information Technology, Ho Chi Minh City University of Technology, 144/24 Dien Bien Phu, Binh Thanh, Ho Chi Minh City, Vietnam

Abstract: Methods for mining high utility itemsets from databases have been discussed widely in recent years. They mine itemsets having high utility from databases. Pruning candidates based on transaction-weighted utilisation value is a good method at all. In this paper, we develop a tree structure called WIT-tree, and use it in the proposed TWU-mining algorithm, an algorithm for improving the mining time and the search space. Using Diffset for fast computing transaction-weighted utilisation values and saving memory will be discussed. Experimental results show that proposed algorithms are more efficient.

Keywords: utility itemsets; utility constraints; utility upper bound; transaction weighted utilisation; WIT-tree; tree structures.

DOI: 10.1504/IJIIDS.2011.038970

International Journal of Intelligent Information and Database Systems, 2011 Vol.5 No.2, pp.164 - 176

Received: 08 Apr 2010
Accepted: 12 Jun 2010
Published online: 21 Oct 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article