Mining association rules between sets of items in large databases
Rakesh Agrawal, Tomasz Imieliński, Ashok Kumar Swami
ACM SIGMOD Record · 1993 · 4,690 citations
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Agrawal, R., Imieliński, T., & Swami, A. K. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD Record, 22(2), 207–216. https://doi.org/10.1145/170036.170072
In text: (Agrawal et al., 1993)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
Abstract
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel estimation and pruning techniques. We also present results of applying this algorithm to sales data obtained from a large retailing company, which shows the effectiveness of the algorithm.
Related papers
Metadata from OpenAlex (CC0). Citations are generated from the published record.