| 2005 | ||
|---|---|---|
| j4 | Nicolas Pasquier, Rafik Taouil, Yves Bastide, Gerd Stumme, Lotfi Lakhal: Generating a Condensed Representation for Association Rules. J. Intell. Inf. Syst. 24(1): 29-60 (2005) | |
| 2004 | ||
| c11 | Tao-Yuan Jen, Rafik Taouil, Dominique Laurent: A Dichotomous Algorithm for Association Rule Mining. DEXA Workshops 2004: 567-571 | |
| 2002 | ||
| j3 | Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal: Computing iceberg concept lattices with T. Data Knowl. Eng. 42(2): 189-222 (2002) | |
| 2001 | ||
| c10 | Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal: Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis. KI/ÖGAI 2001: 335-350 | |
| 2000 | ||
| j2 | Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal: Mining Frequent Patterns with Counting Inference. SIGKDD Explorations 2(2): 66-75 (2000) | |
| c9 | Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal: Levelwise Search of Frequent Patterns with Counting Inference. BDA 2000 | |
| c8 | 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 | |
| c7 | Rafik Taouil, Nicolas Pasquier, Yves Bastide, Lotfi Lakhal: Mining Bases for Association Rules Using Closed Sets. ICDE 2000: 307 | |
| c6 | Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal: Fast Computation of Concept lattices Using Data Mining Techniques. KRDB 2000: 129-139 | |
| 1999 | ||
| j1 | Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal: Efficient Mining of Association Rules Using Closed Itemset Lattices. Inf. Syst. 24(1): 25-46 (1999) | |
| c5 | 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 | |
| c4 | Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal: Discovering Frequent Closed Itemsets for Association Rules. ICDT 1999: 398-416 | |
| 1998 | ||
| c3 | Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal: Pruning closed itemset lattices for associations rules. BDA 1998 | |
| c2 | Kitsana Waiyamai, Rafik Taouil, Lotfi Lakhal: Querying Concept Lattices in Object Databases. IADT 1998: 280-289 | |
| 1997 | ||
| c1 | Kitsana Waiyamai, Rafik Taouil, Lotfi Lakhal: Towards an Object Database Approach for Managing Concept Lattices. ER 1997: 299-312 | |
| 1 | Yves Bastide | |
| 2 | Tao-Yuan Jen | |
| 3 | Lotfi Lakhal | |
| 4 | Dominique Laurent | |
| 5 | Nicolas Pasquier | |
| 6 | Gerd Stumme | |
| 7 | Kitsana Waiyamai |
Colors in the list of coauthors
Last update Sat May 18 07:09:26 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page