The Representative Basis for Association Rules

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2001, Pages 639-640

  Phan Luong, Viet ^a  

^a UNIVERSITÉ DE PROVENCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11944266142     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme and L. Lakhal, "Mining minimal non-redundant association rules using frequent closed itemsets", the 6th Int'l Conf. on Ded. and Obj. Databases (DOOD'00). Stream of the 1st Int'l Conf. on Comput. Logics (CL'00), LNCS 1861:972-986, Springer Verlag, London, UK, 2000.
2. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme and L. Lakhal, "Pascal: un algorithme d'extraction des motifs fréquents", Technique et Science Informatique - TSI, 2001 (to appear).
3. B. Ganter and R. Wille, Formal Concept Analysis: Mathematiccal Foundations, Springer, 1999.
4. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Discovering frequent closed itemsets for association rules", the 7th Int'l Conf. on Database Theory (ICDT'99):398-416, 1999.
5. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, "Closed Set Based Discovery of Small Covers for Association Rules", 15eme journées Bases de Données Avancées (BDA'99):361-381, Bordeaux, France, 1999.
6. th ACM SIGMOD Int'l Conf. on Knowledge Discovery and Data Mining (KDD 2000):34-43, Boston, MA, August 2000.