Author:
Mkhinini Gahar Rania,Arfaoui Olfa,Hidri Adel,Alsaif Suleiman Ali,Sassi Hidri Minyar
Publisher
Springer Nature Switzerland
Reference24 articles.
1. Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Databases (VLDB), vol. 1215, pp. 487–499. Santiago, Chile (1994)
2. Bellman, R., Kalaba, R.: Dynamic programming and statistical communication theory. Proc. Natl. Acad. Sci. U.S.A. 43(8), 749 (1957)
3. Borgelt, C.: An implementation of the FP-growth algorithm. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, pp. 1–5 (2005)
4. Chang, J.H., Lee, W.S.: Finding recent frequent itemsets adaptively over online data streams. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 487–492 (2003)
5. Cheng, J., Ke, Y., Ng, W.: $$\backslash $$delta-tolerance closed frequent itemsets. In: Proceedings of the Sixth International Conference on Data Mining (ICDM), pp. 139–148. IEEE (2006)