Induction of Association Rules: Apriori Implementation

By Christian Borgelt, Rudolf Kruse. International Conference on Computational Statistics, 2002

357 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/70e46f990a0e1b3675d4ef80e92a7bc89285a99a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Bart Goethals
2. Michael R. Berthold
3. Bettina Gr
4. Kurt Hornik
5. Michael Hahsler
6. Christian Borgelt
7. Till Quack
8. Cynthia Rudin

In Information Systems

1. Michael Hahsler
2. Bart Goethals
3. Michael R. Berthold
4. Kurt Hornik
5. Bettina Gr
6. Christian Borgelt
7. Till Quack
8. Cynthia Rudin

Citations in the corpus

• Introduction to arules — Mining Association Rules and Frequent Item Sets (2006, methodology): “In package arules we interface free reference implementations of Apriori and Eclat by Christian Borgelt (Borgelt and Kruse, 2002; Borgelt, 2003).”
• EFFICIENT IMPLEMENTATIONS OF APRIORI AND ECLAT (2003, background): “This tree is grown top-down level by level, pruning those branches that cannot contain a frequent item set [4].”
• Survey on Frequent Pattern Mining (2003, methodology): “This procedure can still be optimized, as is described in [11].”
• Mining molecular fragments: finding relevant substructures of molecules (2002, methodology): “An efficient implementation can use a data structure like the tree shown in Figure 1 to store the counters [2, 3].”