Keywords
Association rule learningComputer scienceAlgorithmAssociation (psychology)Data miningAlgorithm design
Related Publications
A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
One program to rule them all Computers can beat humans at increasingly complex games, including chess and Go. However, these programs are typically constructed for a particular ...
IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies
Large phylogenomics data sets require fast tree inference methods, especially for maximum-likelihood (ML) phylogenies. Fast programs exist, but due to inherent heuristics to fin...
When to use and how to report the results of PLS-SEM
Purpose The purpose of this paper is to provide a comprehensive, yet concise, overview of the considerations and metrics required for partial least squares structural equation m...
Training Products of Experts by Minimizing Contrastive Divergence
It is possible to combine multiple latent-variable models of the same data by multiplying their probability distributions together and then renormalizing. This way of combining ...
IQPNNI: Moving Fast Through Tree Space and Stopping in Time
An efficient tree reconstruction method (IQPNNI) is introduced to reconstruct a phylogenetic tree based on DNA or amino acid sequence data. Our approach combines various fast al...
Publication Info
- Year
- 1994
- Type
- article
- Pages
- 487-499
- Citations
- 915
- Access
- Closed
External Links
Citation Metrics
915
OpenAlex
Cite This
R. K. Agrawal
(1994).
Fast algorithm for mining association rules.
Very Large Data Bases
, 487-499.