Parallel Method for Mining High Utility Itemsets from Vertically Partitioned Distributed Databases
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
An efficient strategy for mining high utility itemsets
International Journal of Intelligent Information and Database Systems
High utility pattern mining using the maximal itemset property and lexicographic tree structures
Information Sciences: an International Journal
A tree-based approach for mining frequent weighted utility itemsets
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
| Hi-index | 0.00 |
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.