Reference14 articles.
1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, USA, pp. 207–216, 1993.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Verkamo. Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining, pp. 307–328, AAAI/MIT Press, Cambridge, MA 1996.
3. J. Bourdon. Size and path-length of Patricia tries: Dynamical sources context. Random Structures and Algorithms, 19: 289–315, 2001.
4. J. Bourdon, M. Nebel, and B. Vallée. On the stack-size of general tries. Theoretical Informatics and Applications, 35:163–185, 2001.
5. J. Clément, P. Flajolet, and B. Vallée. Dynamical sources in information theory: A general analysis of trie structures. Algorithmica, 29(1):307–369, 2001.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献