Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Designing Templates for Mining Association Rules
Journal of Intelligent Information Systems
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
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A New SQL-like Operator for Mining Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
ACM Transactions on Information Systems (TOIS)
Mining Inter-transactional Association Rules: Generalization and Empirical Evaluation
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Patterns Discovery Based on Time-Series Decomposition
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Sequential Association Rule Mining with Time Lags
Journal of Intelligent Information Systems
Information Sciences—Informatics and Computer Science: An International Journal
Information Sciences: an International Journal
Efficient mining of cross-transaction web usage patterns in large database
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Discovery of Online Shopping Patterns Across Websites
INFORMS Journal on Computing
Hi-index | 0.00 |
Multi-dimensional, inter-transaction association rules extend the traditional association rules to describe more general associations among items with multiple properties cross transactions. “After McDonald and Burger King open branches, KFC will open a branch two months later and one mile away” is an example of such rules. Since the number of potential inter-transaction association rules tends to be extremely large, mining inter-transaction associations poses more challenges on efficient processing than mining intra-transaction associations. In order to make such association mining truly practical and computationally tractable, in this study, we present a template model to help users declare the interesting inter-transaction associations to be mined. With the guidance of templates, several optimization techniques are devised to speed up the discovery of inter-transaction association rules. We show, through a series of experiments, that these optimization techniques can yield significant performance benefits.