CP-tree: a tree structure for single-pass frequent pattern mining

Authors:
Syed Khairuzzaman Tanbeer;Chowdhury Farhan Ahmed;Byeong-Soo Jeong;Young-Koo Lee
Affiliations:
Department of Computer Engineering, Kyung Hee University, Youngin-si, Kyunggi-do, Republic of Korea;Department of Computer Engineering, Kyung Hee University, Youngin-si, Kyunggi-do, Republic of Korea;Department of Computer Engineering, Kyung Hee University, Youngin-si, Kyunggi-do, Republic of Korea;Department of Computer Engineering, Kyung Hee University, Youngin-si, Kyunggi-do, Republic of Korea
Venue:
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2008

Citing 5
Cited 18

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
CanTree: a canonical-order tree for incremental frequent-pattern mining

Knowledge and Information Systems
Frequent pattern mining: current status and future directions

Data Mining and Knowledge Discovery

Efficient frequent pattern mining over data streams

Proceedings of the 17th ACM conference on Information and knowledge management
RP-Tree: A Tree Structure to Discover Regular Patterns in Transactional Database

IDEAL '08 Proceedings of the 9th International Conference on Intelligent Data Engineering and Automated Learning
Mining Weighted Frequent Patterns Using Adaptive Weights

IDEAL '08 Proceedings of the 9th International Conference on Intelligent Data Engineering and Automated Learning
Efficient Single-Pass Mining of Weighted Interesting Patterns

AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Mining Weighted Frequent Patterns in Incremental Databases

PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Mining high utility patterns in incremental databases

Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Mining Regular Patterns in Transactional Databases

IEICE - Transactions on Information and Systems
Handling Dynamic Weights in Weighted Frequent Pattern Mining

IEICE - Transactions on Information and Systems
Discovering Periodic-Frequent Patterns in Transactional Databases

PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
An Efficient Candidate Pruning Technique for High Utility Pattern Mining

PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Sliding window-based frequent pattern mining over data streams

Information Sciences: an International Journal
SPO-Tree: efficient single pass ordered incremental pattern mining

DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Distributed methodology of cantree construction

MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
Mining single pass weighted pattern tree

ICDEM'10 Proceedings of the Second international conference on Data Engineering and Management
Extrapolation prefix tree for data stream mining using a landmark model

DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
Scalable technique to discover items support from trie data structure

ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
EFP-M2: efficient model for mining frequent patterns in transactional database

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
ShrFP-tree: an efficient tree structure for mining share-frequent patterns

AusDM '08 Proceedings of the 7th Australasian Data Mining Conference - Volume 87

Quantified Score

Hi-index	0.00

Visualization

Abstract

FP-growth algorithm using FP-tree has been widely studied for frequent pattern mining because it can give a great performance improvement compared to the candidate generation-and-test paradigm of Apriori. However, it still requires two database scans which are not applicable to processing data streams. In this paper, we present a novel tree structure, called CP-tree (Compact Pattern tree), that captures database information with one scan (Insertion phase) and provides the same mining performance as the FP-growth method (Restructuring phase) by dynamic tree restructuring process. Moreover, CP-tree can give full functionalities for interactive and incremental mining. Extensive experimental results show that the CP-tree is efficient for frequent pattern mining, interactive, and incremental mining with single database scan.