Alan P. Sprague. On the computational complexity of two frequent set generation algorithms. In Proceedings of the 2004 International Conference on Machine Learning and Applications - ICMLA 2004, 16-18 December 2004, Louisville, KY, USA. pages 344-350, IEEE Computer Society, 2004. [doi]
Abstract is missing.