Author:
Vo Bay,Hong Tzung-Pei,Le Bac
Subject
Artificial Intelligence,Computer Science Applications,General Engineering
Reference27 articles.
1. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In VLDB’94 (pp. 487–499).
2. Bastide, Y., Pasquier, N., Taouil, R., Stumme, & G., Lakhal, L. (2000). Mining minimal non-redundant association rules using frequent closed itemsets. In First international conference on computational logic (pp. 972–986).
3. BitTable-FI: An efficient mining frequent itemsets algorithm;Dong;Knowledge Based Systems,2007
4. Fast algorithms for frequent itemset mining using fp-trees;Grahne;IEEE Transactions on Knowledge and Data Engineering,2005
5. Maintenance of fast updated frequent pattern trees for record deletion;Hong;Computational Statistics and Data Analysis,2009
Cited by
70 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献