Author:
Lin Ke-Chung,Liao I-En,Chen Zhi-Sheng
Subject
Artificial Intelligence,Computer Science Applications,General Engineering
Reference10 articles.
1. Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD conference on management of data (pp. 207–216).
2. Agrawal, R., & Srikant, R. (1994). Fast algorithm for mining association rules in large databases. In Proceedings of 20th VLDB conference (pp. 487–499).
3. Fast algorithms for frequent itemset mining using FP-trees;Grahne;IEEE Transactions on Knowledge and Data Engineering,2005
4. Han, J., Pei, J. & Yin, Y. (2000). Mining frequent patterns without candidate generation. In Proceedings of the ACM-SIGMOD conference management of data (pp. 1–12).
5. Mining frequent patterns without candidate generation: A frequent-pattern tree approach;Han;Data Mining and Knowledge Discovery,2004
Cited by
61 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献