Intelligent Information and Database Systems, Asian Conference on (2009)
Dong hoi, Quang binh, Vietnam
Apr. 1, 2009 to Apr. 3, 2009
The utility based itemset mining approach has been discussed widely in recent years. There are many algorithms mining high utility itemsets by pruning candidates based on estimated utility values, and based on transaction-weighted utilization values. These algorithms aim to reduce search space. Besides, candidate pruning based on transaction-weighted utilization value is better than other strategies. In this paper, we propose TWU-Mining, a novel algorithm based-on WIT-tree for improving the cost of time and search space. Experiments show that the proposed algorithm is more effective on the testing databases.
Utility itemset, utility constraint, utility upper bound, transaction-weighted utilization, WIT-tree
H. Nguyen, B. Le, B. Vo and T. A. Cao, "A Novel Algorithm for Mining High Utility Itemsets," Intelligent Information and Database Systems, Asian Conference on(ACIIDS), Dong hoi, Quang binh, Vietnam, 2009, pp. 13-17.