Yves Bastide

12 papers A* 1A 1Journal 4Unranked 6
YearRankTypeTitle / Venue / Authors
2005 J jnl
Generating a Condensed Representation for Association Rules.
J. Intell. Inf. Syst.
Nicolas Pasquier, Rafik Taouil, Yves Bastide, Gerd Stumme, Lotfi Lakhal
2002 J jnl
Computing iceberg concept lattices with T.
Data Knowl. Eng.
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal
2001 — conf
Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis.
KI/ÖGAI
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal
2000 — conf
Fast Computation of Concept lattices Using Data Mining Techniques.
KRDB
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal
2000 — conf
Levelwise Search of Frequent Patterns with Counting Inference.
BDA
Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal
2000 A* conf
Mining Bases for Association Rules Using Closed Sets.
ICDE
Rafik Taouil, Nicolas Pasquier, Yves Bastide, Lotfi Lakhal
2000 J jnl
Mining Frequent Patterns with Counting Inference.
SIGKDD Explor.
Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal
2000 — conf
Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets.
Computational Logic
Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, Lotfi Lakhal
1999 — conf
Closed Set Based Discovery of Small Covers for Association Rules.
Proc. 15èmes Journées Bases de Données Avancées, BDA
Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal
1999 A conf
Discovering Frequent Closed Itemsets for Association Rules.
ICDT
Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal
1999 J jnl
Efficient Mining of Association Rules Using Closed Itemset Lattices.
Inf. Syst.
Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal
1998 — conf
Pruning closed itemset lattices for associations rules.
BDA
Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal