Publisher
Springer Berlin Heidelberg
Reference56 articles.
1. R. Agrawal, T. Imielinski, A. Swami. Mining association rules between sets of items in large databases. Proc. SIGMOD Conf., 1993, 207–216
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. Proc. VLDB Conf., 1994, 478–499 (Expanded version in IBM Report RJ9839)
3. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. of the 11th Int’l Conf. on Data Engineering (ICDE), pages 3–14, Mar. 1995.
4. A. Arnauld, P. Nicole: La logique ou l’art de penser-contenant, outre les règles communes, plusieurs observations nouvelles, propres à former le jugement. Ch. Saveux, Paris 1668
5. Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, L. Lakhal: Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets. In: J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv, P. J. Stuckey (eds.): Computational Logic-CL. Proc. 1st Intl. Conf. on CL (6th Intl. Conf. on Database Systems). LNAI 1861, Springer, Heidelberg 2000, 972–986
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献