An Efficient Candidate Pruning Technique for High Utility Pattern Mining

Authors:
Chowdhury Farhan Ahmed;Syed Khairuzzaman Tanbeer;Byeong-Soo Jeong;Young-Koo Lee
Affiliations:
Department of Computer Engineering, Kyung Hee University, Republic of Korea 446-701;Department of Computer Engineering, Kyung Hee University, Republic of Korea 446-701;Department of Computer Engineering, Kyung Hee University, Republic of Korea 446-701;Department of Computer Engineering, Kyung Hee University, Republic of Korea 446-701
Venue:
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Year:
2009

Citing 7
Cited 1

Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach

Data Mining and Knowledge Discovery
Mining itemset utilities from transaction databases

Data & Knowledge Engineering - Special issue: ER 2003
CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach

CIT '07 Proceedings of the 7th IEEE International Conference on Computer and Information Technology
Isolated items discarding strategy for discovering high utility itemsets

Data & Knowledge Engineering
CP-tree: a tree structure for single-pass frequent pattern mining

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
A two-phase algorithm for fast discovery of high utility itemsets

PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining

An efficient strategy for mining high utility itemsets

International Journal of Intelligent Information and Database Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

High utility pattern mining extracts more useful and realistic knowledge from transaction databases compared to the traditional frequent pattern mining by considering the non-binary frequency values of items in transactions and different profit values for every item. However, the existing high utility pattern mining algorithms suffer from the level-wise candidate generation-and-test problem and need several database scans to mine the actual high utility patterns. In this paper, we propose a novel tree-based candidate pruning technique HUC-Prune (high utility candidates prune) to efficiently mine high utility patterns without level-wise candidate generation-and-test. It exploits a pattern growth mining approach and needs maximum three database scans in contrast to several database scans of the existing algorithms. Extensive experimental results show that our technique is very efficient for high utility pattern mining and it outperforms the existing algorithms.