Rafik Taouil

According to our database, Rafik Taouil authored at least 16 papers between 1997 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2018

Restructuring Iceberg Lattice For Multilevel Analysis.

Rafik Taouil, Ilyass Belghannou

Proceedings of the 6th International Conference on Multimedia Computing and Systems, 2018

2005

Generating a Condensed Representation for Association Rules.

Nicolas Pasquier, Rafik Taouil, Yves Bastide, Gerd Stumme, Lotfi Lakhal

J. Intell. Inf. Syst., 2005

2004

A Dichotomous Algorithm for Association Rule Mining.

Tao-Yuan Jen, Rafik Taouil, Dominique Laurent

Proceedings of the 15th International Workshop on Database and Expert Systems Applications (DEXA 2004), with CD-ROM, 30 August, 2004

2002

Computing iceberg concept lattices with T.

Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal

Data Knowl. Eng., 2002

2001

Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis.

Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal

Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001

2000

Mining Frequent Patterns with Counting Inference.

Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal

SIGKDD Explor., 2000

Fast Computation of Concept lattices Using Data Mining Techniques.

Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal

Proceedings of the 7th International Workshop on Knowledge Representation meets Databases (KRDB 2000), 2000

Mining Bases for Association Rules Using Closed Sets.

Rafik Taouil, Nicolas Pasquier, Yves Bastide, Lotfi Lakhal

Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, February 28, 2000

Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets.

Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, Lotfi Lakhal

Proceedings of the Computational Logic, 2000

Levelwise Search of Frequent Patterns with Counting Inference.

Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal

Proceedings of the 16èmes Journées Bases de Données Avancées, 2000

1999

Efficient Mining of Association Rules Using Closed Itemset Lattices.

Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal

Inf. Syst., 1999

Discovering Frequent Closed Itemsets for Association Rules.

Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal

Proceedings of the Database Theory, 1999

Closed Set Based Discovery of Small Covers for Association Rules.

Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal

Proceedings of the 15èmes Journées Bases de Données Avancées, 1999

1998

Querying Concept Lattices in Object Databases.

Kitsana Waiyamai, Rafik Taouil, Lotfi Lakhal

Proceedings of the Third International Conference on Integrated Design and Process Technology, IDPT, 1998

Pruning closed itemset lattices for associations rules.

Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal

Proceedings of the 14ème Journées Bases de Données Avancées, 1998

1997

Towards an Object Database Approach for Managing Concept Lattices.

Kitsana Waiyamai, Rafik Taouil, Lotfi Lakhal

Proceedings of the Conceptual Modeling, 1997