Keywords
Association rule learningComputer scienceData miningDatabaseAlgorithmInformation retrieval
Related Publications
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasin...
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...
Using Linear Algebra for Intelligent Information Retrieval
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users’ requests and those in or assigned to docum...
Input feature selection by mutual information based on Parzen window
Mutual information is a good indicator of relevance between variables, and have been used as a measure in several feature selection algorithms: However, calculating the mutual i...
eggNOG-mapper v2: Functional Annotation, Orthology Assignments, and Domain Prediction at the Metagenomic Scale
Abstract Even though automated functional annotation of genes represents a fundamental step in most genomic and metagenomic workflows, it remains challenging at large scales. He...
Publication Info
- Year
- 1994
- Type
- article
- Pages
- 487-499
- Citations
- 9372
- Access
- Closed
External Links
Citation Metrics
9372
OpenAlex
Cite This
Rakesh Agrawal,
Ramakrishnan Srikant
(1994).
Fast Algorithms for Mining Association Rules in Large Databases.
Very Large Data Bases
, 487-499.