1. 1. R. Agrawal, and R. Srikant, “Fast Algorithms for Mining Association Rules”, In Proc. VLDB 1994, pp.487-499
   2. A. Savasere, E. Omiecinski, and S. Navathe, “An Efficient Algorithm for Mining Association Rules in Large Databases”, In VLDB’95, pp.432-443, Zurich, Switzerland
   3. S. Brin, et a1. Dynamic item set counting and implication rules for market basket data. Proceedings of the ACM SIGMOD International Conference on Management of Data. 1997. 123-140
   4. J. S. Park, M. S. Chen, P. S. Yu. Efficient parallel data mining of association rules. 4th International Conference on Information and Knowledge Management, 1995, 11: 233- 235P
   5. Jeffrey Dean,Sanjay Ghemawat.Map/Reduce:Simplified Data Processing on Large Clusters[R]. OSDI’04: Sixth Symposium on Operating System Design and Implementation 2004
   6. Li N., Zeng L., He Q. & Shi Z. (2012). Parallel Implementation of Apriori Algorithm Based on MapReduce. In:Proceedings of the 13th ACM International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel & Distributed Computing (SNPD ‘12). Kyoto, IEEE: 236–241.
   7. Lin M., Lee P. & Hsueh S. (2012). Apriori-based Frequent Item set Mining Algorithms on MapReduce. Proc. of the 16th International Conference on Ubiquitous Information Management and Communication (ICUIMC ‘12). New York, NY, USA, ACM: Article No.76