Association Rule Mining Action Set

References

  • Agrawal, R., Imieliński, T., and Swami, A. (1993). “Mining Association Rules between Sets of Items in Large Databases.” In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216. New York: ACM Press. https://doi.org/10.1145/170035.170072.

  • Agrawal, R., and Srikant, R. (1994). “Fast Algorithms for Mining Association Rules in Large Databases.” In Proceedings of the 20th International Conference on Very Large Data Bases, 487–499. San Francisco: Morgan Kaufmann. http://www.vldb.org/conf/1994/P487.PDF.

  • Han, J., Pei, J., and Yin, Y. (2000). “Mining Frequent Patterns without Candidate Generation.” In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. New York: ACM Press. https://www.cs.sfu.ca/~jpei/publications/sigmod00.pdf.

  • Han, J., Pei, J., Yin, Y., and Mao, R. (2004). “Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach.” Data Mining and Knowledge Discovery 8:53–87.

Last updated: September 10, 2021