1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I., et al.: Fast discovery of association rules. Adv. Knowl. Discov. Data Min. 12(1), 307–328 (1996)
2. Ananthanarayana, V., Murty, M.N., Subramanian, D.: Tree structure for efficient data mining using rough sets. Pattern Recognit. Lett. 24(6), 851–862 (2003)
3. Baralis, E., Cerquitelli, T., Chiusano, S.: A persistent hy-tree to efficiently support itemset mining on large datasets. In: Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 1060–1064. ACM (2010)
4. Bodon, F.: A fast apriori implementation, rpi cs department technical report tr 03-14 (2003)
5. Chen, J., Xiao, K.: Bisc: a bitmap itemset support counting approach for efficient frequent itemset mining. ACM Trans. Knowl. Discov. Data (TKDD) 4(3), 12 (2010)