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={SIGMOD '93},
  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.Expand
Application of association rules to determine item sets from large databases
TLDR
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
we consider the problem of discovering frequent item sets and association rules between items in a large database of transactional databases acquired under uncertainty. With each transaction
A fast algorithm for mining association rules
TLDR
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
TLDR
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
TLDR
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
TLDR
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.
Fast algorithms for mining association rules
TLDR
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. An important application area of mining association rules is the
MINING ASSOCIATION RULES FOR LARGE TRANSACTIONS USING NEW SUPPORT AND CONFIDENCE MEASURES
TLDR
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.
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
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
Database Mining: A Performance Perspective
TLDR
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
TLDR
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
TLDR
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
TLDR
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
  • L. Valiant
  • Mathematics, Computer Science
    STOC '84
  • 1984
TLDR
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
TLDR
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.
Bala Iyer, and Arun Swami, \An Interval Classiier for Database Mining Applications
  • Bala Iyer, and Arun Swami, \An Interval Classiier for Database Mining Applications
  • 1992
Bridging the Gap Between Database Theory and Practice
  • Cadre Technologies,
  • 1992
...
1
2
3
...