Frequent Pattern Mining Algorithms: A Survey - Frequent Pattern Mining - page 63

68. J. Wang, J. Han, Y. Lu, and P. Tzvetkov. TFP: An efficient algorithm for mining top- k frequent
closed itemsets. IEEE Transactions on Knowledge and Data Engineering , 17, pp. 652-664,
2002.
69. J. Wang, J. Han, and J. Pei. CLOSET+: Searching for the Best strategies for mining frequent
closed itemsets. ACM KDD Conference , 2003.
70. G. I. Webb. Efficient Search for Association Rules, ACM KDD Conference , 2000.
71. M. J. Zaki. Scalable algorithms for association mining, IEEE Transactions on Knowledge and
Data Engineering , 12(3), pp. 372-390, 2000.
72. M. Zaki, and K. Gouda. Fast vertical mining using diffsets. ACM KDD Conference , 2003.
73. M. J. Zaki and C. Hsiao. CHARM: An efficient algorithm for closed association rule mining.
SDM Conference , 2002.
74. M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New Algorithms for Fast Discovery of
Association Rules. KDD Conference , pp. 283-286, 1997.
75. C. Zeng, J. F. Naughton, and JY Cai. On Differentially Private Frequent Itemset Mining. In
Proceedings of 39th International Conference on Very Large data Bases, 2012.