Memory Efficient Frequent Itemset Mining-Reference-Cited by-同舟云学术

Memory Efficient Frequent Itemset Mining

Published:2018 Issue: Volume: Page:16-27
ISSN:0302-9743
Container-title:Machine Learning and Data Mining in Pattern Recognition
language:
Short-container-title:

Author:

Shahbazi Nima,Soltani Rohollah,Gryz Jarek

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-96133-0_2

Reference16 articles.

1. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD Record, vol. 22, pp. 207–216. ACM (1993)

2. Blake, C.L., Merz, C.J.: UCI repository of machine learning databases. Department of Information and Computer Science, University of California, Irvine, p. 55 (1998). http://www.ics.uci.edu/~mlearn/mlrepository.html

3. Buehrer, G., Parthasarathy, S., Tatikonda, S., Kurc, T., Saltz, J.: Toward terabyte pattern mining: an architecture-conscious solution. In: Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 2–12. ACM (2007)

4. Deng, Z.-H., Lv, S.-L.: Fast mining frequent itemsets using nodesets. Expert Syst. Appl. 41(10), 4505–4512 (2014)

5. Deng, Z.-H., Lv, S.-L.: Prepost+: an efficient n-lists-based algorithm for mining frequent itemsets via children-parent equivalence pruning. Expert Syst. Appl. 42(13), 5424–5432 (2015)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Upper bounds for can-tree and FP-tree;Journal of Intelligent Information Systems;2021-09-21

2. Upper Bound on the Size of FP-Tree;Advances in Databases and Information Systems;2020