1. 1. R. Agrawal and R. Srikant, ``Fast algorithms for mining association rules,'' in Proc. VLDB, vol. 94, pp. 487_499, Sep. 1994.
   2. R. Agrawal, T. Imielinski, and A. Swami, ``Mining association rules between set of items in large databases,'' in Proc. SIGMOD, vol. 93, no. 2, pp. 207_216, 1993.
   3. Z.-H. Deng and X.-R. Xu, ``Fast mining erasable itemsets using NC_sets,'' Expert Syst. Appl., vol. 39, no. 4, pp. 4453_4463, 2012.
   4. T.-L. Dam, K. Li, P. Fournier-Viger, and Q.-H. Duong, “An efficient algorithm for mining top-rank-k frequent patterns,” Appl. Intelligent, vol. 45, no. 1, pp. 96_111, 2016.
   5. J. Han, J. Pei, and Y. Yin,“ Mining frequent patterns without candidate generation,” in Proc. SIGMOD, pp. 1_12, 2000.
   6. C.-W. Lin and T.-P. Hong,“ Maintenance of pre-large trees for data mining with modified records,'' Inf. Sci., vol. 278, pp. 88_103, Sep. 2014.
   7. G. Pyun and U. Yun, ``Mining top-k frequent patterns with combination reducing techniques,'' Appl. Intell., vol. 41, no. 1, pp. 76_98, 2014.
   8. U. Yun and G. Lee, ``Sliding window based weighted erasable stream pattern mining for stream data applications,'' Future Generate. Computer. Syst., vol. 59, pp. 1_20, Jun. 2016
   9. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal ``Discovering frequent closed itemsets for association rules,'' in Proc. ICDT, vol. 99. 1999, pp. 398_416.
   10.  V. S. Tseng, B. E. Shie, C. W. Wu, and P. S. Yu, “Efficient algorithms for mining high utility itemsets from transactional databases,” IEEE Trans. Knowledge. Data Eng., vol. 25, no. 8, pp. 1772_1786, Aug. 2013..