1. 1. M. J. Zaki, “Parallel and distributed association mining: A survey,” Concurrency, IEEE, vol. 7, no. 4, pp. 14–25, 1999.
   2. Yaling Xun, Jifu Zhang, Xiao Qin and Xujun Zhao “FiDoop-DP: Data Partitioning in Frequent Item-set Mining on Hadoop Clusters” IEEE Transactions on Parallel and Distributed Systems, pp.7- 14, 2016.
   3. W. Lu, Y. Shen, S. Chen, and B. C. Ooi, “Efficient processing of knearest neighbor joins using mapreduce,” Proceedings of the VLDB Endowment, vol. 5, no. 10, pp. 1016–1027, 2012.
   4. I. Pramudiono and M. Kitsuregawa, “Parallel fpgrowth on pc cluster,” in Advances in Knowledge Discovery and Data Mining. Springer, 2003, pp. 467–473.
   5. A. Stupar, S. Michel, and R. Schenkel, “Rank reduce– processing knearest-neighbor queries on top of mapreduce,” in Proceedings of the 8th Workshop on Large-Scale Distributed Systems for Information Retrieval. Citeseer, 2010, pp. 13–18.
   6. B. Bahmani, A. Goel, and R. Shinde, “Efficient distributed locality sensitive hashing,” in Proceedings of the 21st ACM international conference on Information and knowledge management.ACM, 2012, pp.2174–2178.
   7. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu, “An efficient kmeans clustering algorithm: Analysis and implementation,” Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 24, no. 7, pp. 881–892, 2002.
   8. A. K. Jain, “Data clustering: 50 years beyond kmeans,” Pattern Recognition Letters, vol. 31, no. 8, pp. 651–666, 20
   9. http://www.phillipefourier.comAccessed on June 22, 2017.