Author:
Patro Pranaya Pournamashi,Senapati Rajiv
Reference15 articles.
1. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)
2. Al-Maolegi, M., Arkok, B.: An Improved Apriori Algorithm for Association Rules. arXiv preprint arXiv:1403.3948 (2014)
3. Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng., 372–390 (2000)
4. El-Hajj, M., Zaiane, O.R.: Non recursive generation of frequent K-itemsets from frequent pattern tree representations. In: International Conference on Data Warehousing and Knowledge Discovery, pp. 371–380 (2003)
5. d Burdick, M.C., Gehrke, J.: Mafia: a maximal frequent itemset algorithm for transactional databases. In: Proceedings 17th International Conference on Data Engineering, pp. 443–452 (2001)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献