References

Probably the most often quoted paper on the subject of association rules is the paper describing the Apriori algorithm:

[1] Fast Algorithms for Mining Association Rules in Large Databases, by Rakesh Agrawal and Ramakrishnan Srikant, published in the Proceedings of the 20th International Conference on Very Large Databases, 1994, pages 487-499.

The technical report version of this paper contains more detailed information about the algorithm implementations:

[1a] Fast Algorithms for Mining Association Rules, by Rakesh Agrawal and Ramakrishnan Srikant, IBM Almaden Research Center Technical Report RJ9839, 1994.

The Closure algorithm was introduced in:

[2] Galois Connections and Data Mining, by Dana Cristofor, Laurentiu Cristofor, and Dan A. Simovici, published in the Journal of Universal Computer Science, vol. 6, no. 1, 2000, pages 60-73.

The FPgrowth algorithm was introduced in:

[3] Mining Frequent Patterns without Candidate Generation, by Jiawei Han, Jian Pei and Yiwen Yin, published in Proceedings of ACM-SIGMOD International Conference on Management of Data, 2000, pages 1-12.

The CoverRules algorithm comes from a recent article that is currently available only as a technical report:

[4] Generating an informative cover for association rules, by Laurentiu Cristofor and Dan Simovici, UMass/Boston - Computer Science Department Technical Report TR-02-01, 2002.

For information on the various measures used to evaluate an association rule, see:

[5] Mining the Most Interesting Rules, by Roberto Bayardo and Rakesh Agrawal, published in the Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999, pages 145-154.