Author:
Pasquier Nicolas,Bastide Yves,Taouil Rafik,Lakhal Lotfi
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. Proceedings of the ACM SIGMOD Int’l Conference on Management of Data, pages 207–216, May 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. Proceedings of the 20th Int’l Conference on Very Large Data Bases, pages 478–499, June 1994. Expanded version in IBM Research Report RJ9839.
3. R. J. Bayardo. Efficiently mining long patterns from databases. Proceedings of the ACM SIGMOD Int’l Conference on Management of Data, pages 85–93, June 1998.
4. G. Birkhoff. Lattices theory. In Coll. Pub. XXV, volume 25. American Mathematical Society, 1967. Third edition.
5. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. Proceedings of the ACM SIGMOD Int’l Conference on Management of Data, pages 255–264, May 1997.
Cited by
426 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献