Mining association rules between sets of items in large databases

@inproceedings{Agrawal1993MiningAR,
  title={Mining association rules between sets of items in large databases},
  author={Rakesh Agrawal and Tomasz Imielinski and Arun N. Swami},
  booktitle={ACM SIGMOD Conference},
  year={1993}
}
We are given a large database of customer transactions. [] Key Method 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.
View on ACM
dl.acm.org
15,018 Citations
Highly Influential Citations
1,387
Background Citations
5,223
Methods Citations
3,668
Results Citations
65

Figures from this paper

15,018 Citations

Application of association rules to determine item sets from large databases

The empirical evaluation shows that the algorithm outperforms the known algorithms, factors ranging from three for small problems to more than an order of magnitude for large problems.

Analytical Study of Algorithms for Mining Association Rules from Probabilistic Databases and future possibilities

This paper considers the problem of discovering frequent item sets and association rules between items in a large database of transactional databases acquired under uncertainty and discusses generalized algorithms for solving this problem that are fundamentally different from the known algorithms.

A fast algorithm for mining association rules

The problem of discovering association rules between items in a lange database of sales transactions is discussed, and a novel algorithm, BitMatrix, is proposed, which outperforms the known ones for large databases.

Mining Association Rules Induced by Item and Quantity Purchased

In this chapter, a framework based on traditional support-confidence framework for mining each category of association rules is introduced and experimental results based on two databases are presented.

Association Rules Induced by Item and Quantity Purchased

This paper introduces a framework based on traditional support-confidence framework for mining each category of association rules in real market basket data and presents experimental results based on two databases.

Fast algorithms for mining association rules

Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.

Incremental Mining on Association Rules

The discovery of association rules has been known to be useful in selective marketing, decision analysis, and business management, and several research works have developed feasible algorithms for deriving precise association rules efficiently and effectively in dynamic databases.

MINING ASSOCIATION RULES FOR LARGE TRANSACTIONS USING NEW SUPPORT AND CONFIDENCE MEASURES

A new measure is introduced, which does not require initially allotted weights and the quality of transactions is considered by link based models and a fast mining algorithm is adopted.

Fast Algorithms for Mining Association Rules

Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.

Efficient mining of association rules by reducing the number of passes over the database

This paper introduces a new algorithm of mining association rules. The algorithm RP counts the itemsets with different sizes in the same pass of scanning over the database by dividing the database…
...

References

SHOWING 1-10 OF 16 REFERENCES

Database Mining: A Performance Perspective

The authors' perspective of database mining as the confluence of machine learning techniques and the performance emphasis of database technology is presented and an algorithm for classification obtained by combining the basic rule discovery operations is given.

An Interval Classifier for Database Mining Applications

Preliminary experimental results indicate that IC not only has retrieval and classi cation accuracy advantages, but also compares favorably with current tree classi ers, such as ID3, which were primarily designed for minimizing classiCation errors.

Knowledge Discovery in Databases

From the Publisher: Knowledge Discovery in Databases brings together current research on the exciting problem of discovering useful and interesting knowledge in databases. It spans many different…

Knowledge Discovery in Databases: An Overview

After a decade of fundamental interdisciplinary research in machine learning, the spadework in this field has been done; the 1990s should see the widespread exploitation of knowledge discovery as an…

Classification and regression trees

An introduction to classification and regression trees is given by reviewing some widely available algorithms and comparing their capabilities, strengths, and weakness in two examples.

Classification and Regression Trees

This chapter discusses tree classification in the context of medicine, where right Sized Trees and Honest Estimates are considered and Bayes Rules and Partitions are used as guides to optimal pruning.

Discovering Functional Formulas through Changing Representation Base

It appears that for most of the physical laws only two classes of functional formulas - linear functions and second degree polynomials - need to be considered to generate a formula exactly matching the law under consideration.

A theory of the learnable

This paper regards learning as the phenomenon of knowledge acquisition in the absence of explicit programming, and gives a precise methodology for studying this phenomenon from a computational viewpoint.

Scientific Discovery: Computational Explorations of the Creative Processes

Using the methods and concepts of contemporary information-processing psychology (or cognitive science) the authors develop a series of artificial-intelligence programs that can simulate the human thought processes used to discover scientific laws.

Scientific discovery: compulalional explorations of the creative process