Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Beyond market baskets: generalizing association rules to correlations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Query flocks: a generalization of association-rule mining
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Integrating association rule mining with relational database systems: alternatives and implications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Online association rule mining
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
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
Exploiting succinct constraints using FP-trees
ACM SIGKDD Explorations Newsletter
Using a Hash-Based Method with Transaction Trimming for Mining Association Rules
IEEE Transactions on Knowledge and Data Engineering
Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
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)
DualMiner: a dual-pruning algorithm for itemsets with constraints
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Association Analysis with One Scan of Databases
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
OSSM: A Segmentation Approach to Optimize Frequency Counting
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
Efficient dynamic mining of constrained frequent sets
ACM Transactions on Database Systems (TODS)
WAR: Weighted Association Rules for Item Intensities
Knowledge and Information Systems
Efficient closed pattern mining in the presence of tough block constraints
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Interactive Constrained Frequent-Pattern Mining System
IDEAS '04 Proceedings of the International Database Engineering and Applications Symposium
On Closed Constrained Frequent Pattern Mining
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
MotifMiner: Efficient discovery of common substructures in biochemical molecules
Knowledge and Information Systems
A statistical framework for mining substitution rules
Knowledge and Information Systems
TSP: Mining top-k closed sequential patterns
Knowledge and Information Systems
Efficient breadth-first mining of frequent pattern with monotone constraints
Knowledge and Information Systems
CanTree: A Tree Structure for Efficient Incremental Mining of Frequent Patterns
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Efficient Mining of Frequent Itemsets from Data Streams
BNCOD '08 Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge
Efficient single-pass frequent pattern mining using a prefix-tree
Information Sciences: an International Journal
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
Handling Dynamic Weights in Weighted Frequent Pattern Mining
IEICE - Transactions on Information and Systems
WSFI-Mine: Mining Frequent Patterns in Data Streams
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II
Mining frequent arrangements of temporal intervals
Knowledge and Information Systems
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
CloseViz: visualizing useful patterns
Proceedings of the ACM SIGKDD Workshop on Useful Patterns
uCFS2: an enhanced system that mines uncertain data for constrained frequent sets
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
TOPSIL-Miner: an efficient algorithm for mining top-K significant itemsets over data streams
Knowledge and Information Systems
ICDM'10 Proceedings of the 10th industrial conference on Advances in data mining: applications and theoretical aspects
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
Efficient prime-based method for interactive mining of frequent patterns
Expert Systems with Applications: An International Journal
Visual analytics of social networks: mining and visualizing co-authorship networks
FAC'11 Proceedings of the 6th international conference on Foundations of augmented cognition: directing the future of adaptive systems
SPO-Tree: efficient single pass ordered incremental pattern mining
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
The augmented itemset tree: a data structure for online maximum frequent pattern mining
DS'11 Proceedings of the 14th international conference on Discovery science
Single-pass incremental and interactive mining for weighted frequent patterns
Expert Systems with Applications: An International Journal
Distributed methodology of cantree construction
MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
Privacy preserving mining maximal 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
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
Kernel-Tree: mining frequent patterns in a data stream based on forecast support
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
ShrFP-tree: an efficient tree structure for mining share-frequent patterns
AusDM '08 Proceedings of the 7th Australasian Data Mining Conference - Volume 87
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
Expert Systems with Applications: An International Journal
| Hi-index | 0.02 |
Since its introduction, frequent-pattern mining has been the subject of numerous studies, including incremental updating. Many existing incremental mining algorithms are Apriori-based, which are not easily adoptable to FP-tree-based frequent-pattern mining. In this paper, we propose a novel tree structure, called CanTree (canonical-order tree), that captures the content of the transaction database and orders tree nodes according to some canonical order. By exploiting its nice properties, the CanTree can be easily maintained when database transactions are inserted, deleted, and/or modified. For example, the CanTree does not require adjustment, merging, and/or splitting of tree nodes during maintenance. No rescan of the entire updated database or reconstruction of a new tree is needed for incremental updating. Experimental results show the effectiveness of our CanTree in the incremental mining of frequent patterns. Moreover, the applicability of CanTrees is not confined to incremental mining; CanTrees can also be applicable to other frequent-pattern mining tasks including constrained mining and interactive mining.