Author:
Calders Toon,Paredaens Jan
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD, 1993
2. R. Agrawal, R. Srikant. Fast Algorithms for Mining Association Rules. In Proc. VLDB, 1994
3. Technical Report;T. Calders,2000
4. R. Fagin, J. Halpern, and N. Megiddo. A Logic for Reasoning about Probabilities. In Information and Computation 87(1,2): 78–128, 1990.
5. R. Fagin, M. Y. Vardi. Armstrong Databases for Functional and Inclusion Dependencies. In IPL 16(1): 13–19, 1983.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deducing Bounds on the Support of Itemsets;Database Support for Data Mining Applications;2004
2. Axiomatization of frequent itemsets;Theoretical Computer Science;2003-01
3. Discovering Frequent Itemsets in the Presence of Highly Frequent Items;Lecture Notes in Computer Science;2003
4. Discovering approximate keys in XML data;Proceedings of the eleventh international conference on Information and knowledge management - CIKM '02;2002