Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Using association rules for product assortment decisions: a case study
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
An efficient algorithm to update large itemsets with early pruning
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Depth first generation of long patterns
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Exploiting succinct constraints using FP-trees
ACM SIGKDD Explorations Newsletter
Fuzzy association rules and the extended mining algorithms
Information Sciences—Informatics and Computer Science: An International Journal
Mining Frequent Item Sets with Convertible Constraints
Proceedings of the 17th International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A General Incremental Technique for Maintaining Discovered Association Rules
Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA)
Association Analysis with One Scan of Databases
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Efficient Mining of Partial Periodic Patterns in Time Series Database
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
An efficient cluster and decomposition algorithm for mining association rules
Information Sciences—Informatics and Computer Science: An International Journal
Interactive sequence discovery by incremental mining
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
What's hot and what's not: tracking most frequent items dynamically
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Fast Algorithms for Frequent Itemset Mining Using FP-Trees
IEEE Transactions on Knowledge and Data Engineering
Information Sciences—Informatics and Computer Science: An International Journal
Mining spatial association rules in image databases
Information Sciences: an International Journal
CanTree: a canonical-order tree for incremental frequent-pattern mining
Knowledge and Information Systems
EDUA: An efficient algorithm for dynamic database mining
Information Sciences: an International Journal
An efficient algorithm for mining frequent inter-transaction patterns
Information Sciences: an International Journal
Frequent pattern mining: current status and future directions
Data Mining and Knowledge Discovery
A new approach to mine frequent patterns using item-transformation methods
Information Systems
Discovery of maximum length frequent itemsets
Information Sciences: an International Journal
Incremental and interactive mining of web traversal patterns
Information Sciences: an International Journal
Efficient strategies for tough aggregate constraint-based sequential pattern mining
Information Sciences: an International Journal
Incrementally fast updated frequent pattern trees
Expert Systems with Applications: An International Journal
Enhancing SWF for incremental association mining by itemset maintenance
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
A fast algorithm for maintenance of association rules in incremental databases
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Sliding window-based frequent pattern mining over data streams
Information Sciences: an International Journal
An algorithm to mine general association rules from tabular data
Information Sciences: an International Journal
Toward boosting distributed association rule mining by data de-clustering
Information Sciences: an International Journal
Finding top-k elements in data streams
Information Sciences: an International Journal
Using ontologies to facilitate post-processing of association rules by domain experts
Information Sciences: an International Journal
Increasing availability of industrial systems through data stream mining
Computers and Industrial Engineering
Frequent pattern mining using modified CP-tree for knowledge discovery
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
HUC-Prune: an efficient candidate pruning technique to mine high utility patterns
Applied Intelligence
An improved association rules mining method
Expert Systems with Applications: An International Journal
IVIC'11 Proceedings of the Second international conference on Visual informatics: sustaining research and innovations - Volume Part I
Single-pass incremental and interactive mining for weighted frequent patterns
Expert Systems with Applications: An International Journal
Efficient mining regularly frequent patterns in transactional databases
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Interactive mining of high utility patterns over data streams
Expert Systems with Applications: An International Journal
Extracting incidental and global knowledge through compact pattern trees in distributed environment
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Scalable technique to discover items support from trie data structure
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
A unified data mining solution for authorship analysis in anonymous textual communications
Information Sciences: an International Journal
Mining associated sensor patterns for data stream of wireless sensor networks
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Sliding window based weighted maximal frequent pattern mining over data streams
Expert Systems with Applications: An International Journal
Mining frequent correlated graphs with a new measure
Expert Systems with Applications: An International Journal
Mining maximal frequent patterns by considering weight conditions over data streams
Knowledge-Based Systems
Efficient frequent pattern mining based on Linear Prefix tree
Knowledge-Based Systems
Expert Systems with Applications: An International Journal
Hi-index | 0.08 |
The FP-growth algorithm using the FP-tree has been widely studied for frequent pattern mining because it can dramatically improve performance compared to the candidate generation-and-test paradigm of Apriori. However, it still requires two database scans, which are not consistent with efficient data stream processing. 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). The CP-tree introduces the concept of dynamic tree restructuring to produce a highly compact frequency-descending tree structure at runtime. An efficient tree restructuring method, called the branch sorting method, that restructures a prefix-tree branch-by-branch, is also proposed in this paper. Moreover, the CP-tree provides full functionality for interactive and incremental mining. Extensive experimental results show that the CP-tree is efficient for frequent pattern mining, interactive, and incremental mining with a single database scan.