| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. Rafik Taouil 8 Yves Bastide , Nicolas Pasquier , Rafik Taouil, Gerd Stumme , Lotfi Lakhal : Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. Computational Logic 2000 : 972-986 7 Rafik Taouil, Nicolas Pasquier , Yves Bastide , Lotfi Lakhal : Mining Bases for Association Rules Using Closed Sets. ICDE 2000 : 307 6 Gerd Stumme , Rafik Taouil, Yves Bastide , Nicolas Pasquier , Lotfi Lakhal : Fast Computation of Concept lattices Using Data Mining Techniques. KRDB 2000 : 129-139 5 Nicolas Pasquier , Yves Bastide , Rafik Taouil, Lotfi Lakhal : Discovering Frequent Closed Itemsets for Association Rules. ICDT 1999 : 398-416 4 Nicolas Pasquier , Yves Bastide , Rafik Taouil, Lotfi Lakhal : Closed Set Based Discovery of Small Covers for Association Rules. Proc. 15èmes Journées Bases de Données Avancées, BDA 1999 : 361-381 3 Nicolas Pasquier , Yves Bastide , Rafik Taouil, Lotfi Lakhal : Efficient Mining of Association Rules Using Closed Itemset Lattices. Information Systems 24 (1): 25-46 (1999) 2 Kitsana Waiyamai , Rafik Taouil, Lotfi Lakhal : Querying Concept Lattices in Object Databases. IADT 1998 : 280-289 1 Kitsana Waiyamai , Rafik Taouil, Lotfi Lakhal : Towards an Object Database Approach for Managing Concept Lattices. ER 1997 : 299-312 DiSC'01 Copyright ©2002 ACM Inc. |
