Author:
Calders Toon,Goethals Bart
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD Int. Conf. Management of Data, pages 207–216, Washington, D. C., 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB Int. Conf. Very Large Data Bases, pages 487–499, Santiago, Chile, 1994.
3. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. ACM SIGKDD Explorations, 2(2):66–74, 2000.
4. R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. ACM SIGMOD Int. Conf. Management of Data, pages 85–93, Seattle, Washington, 1998.
5. J.-F. Boulicaut and A. Bykowski. Frequent closures as a concise representation for binary data mining. In Proc. P
a
KDD Pacific-Asia Conf. on Knowledge Discovery and Data Mining, pages 62–73, 2000.
Cited by
110 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献