Author:
Szathmary Laszlo,Valtchev Petko,Napoli Amedeo,Godin Robert,Boc Alix,Makarenkov Vladimir
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference38 articles.
1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. of the 20th Intl. Conf. on Very Large Data Bases (VLDB ’94), pp. 487–499. Morgan Kaufmann, San Francisco, CA (1994)
2. Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Proc. of the Computational Logic (CL ’00). LNAI, vol. 1861, pp. 972–986. Springer (2000)
3. Kryszkiewicz, M.: Concise representations of association rules. In: Proc. of the ESF Exploratory Workshop on Pattern Detection and Discovery, pp. 92–109 (2002)
4. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin/Heidelberg (1999)
5. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Proc. of the 7th Intl. Conf. on Database Theory (ICDT ’99), pp. 398–416. Jerusalem, Israel (1999)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献