Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. In 1st International Conference on Computational Logic, July 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Reasoning about Sets using Redescription Mining - Mohammed Zaki Department (2005) (Correct)
No context found.
Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. In 1st International Conference on Computational Logic, July 2000.
Query Expansion Using Fuzzy Association Rules Between Terms - Ch Latiri Ben (2003) (Correct)
No context found.
Y. Bastide, N. Pasquier, R. Taouil, L. Lakhal, and G. Stumme. Mining minimal non-redundant association rules using frequent closed itemsets. In Proceedings of the International Conference DOOD'2000.
MIRAGE: A Framework for Mining, Exploring and Visualizing.. - Zaki, Phoophakdee (Correct)
No context found.
Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. In 1st International Conference on Computational Logic, July 2000.
Generating an Informative Cover for Association Rules - Cristofor, Simovici (2002) (4 citations) (Correct)
No context found.
Yves Bastide, Nicolas Pasquier, Rak Taouil, Gerd Stumme, and Lot Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. In Proceedings of the First International Conference on Computational Logic, pages 972-986, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC