Follow
Lotfi LAKHAL
Lotfi LAKHAL
Full Professor of Computer Science, Aix-Marseille Université
Verified email at univ-amu.fr - Homepage
Title
Cited by
Cited by
Year
Discovering frequent closed itemsets for association rules
N Pasquier, Y Bastide, R Taouil, L Lakhal
Database Theory—ICDT’99: 7th International Conference Jerusalem, Israel …, 1999
21161999
Efficient mining of association rules using closed itemset lattices
N Pasquier, Y Bastide, R Taouil, L Lakhal
Information systems 24 (1), 25-46, 1999
11731999
Computing iceberg concept lattices with titanic
G Stumme, R Taouil, Y Bastide, N Pasquier, L Lakhal
Data & knowledge engineering 42 (2), 189-222, 2002
6042002
Mining minimal non-redundant association rules using frequent closed itemsets
Y Bastide, N Pasquier, R Taouil, G Stumme, L Lakhal
Computational Logic—CL 2000: First International Conference London, UK …, 2000
4992000
Mining frequent patterns with counting inference
Y Bastide, R Taouil, N Pasquier, G Stumme, L Lakhal
ACM SIGKDD Explorations Newsletter 2 (2), 66-75, 2000
4512000
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface
M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ...
Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006
397*2006
Efficient discovery of functional dependencies and armstrong relations
S Lopes, JM Petit, L Lakhal
Advances in Database Technology—EDBT 2000: 7th International Conference on …, 2000
2732000
Generating a condensed representation for association rules
N Pasquier, R Taouil, Y Bastide, G Stumme, L Lakhal
Journal of intelligent information systems 24, 29-60, 2005
2462005
Intelligent structuring and reducing of association rules with formal concept analysis
G Stumme, R Taouil, Y Bastide, N Pasquier, L Lakhal
KI 2001: Advances in Artificial Intelligence: Joint German/Austrian …, 2001
1422001
Pruning closed itemset lattices for association rules
N Pasquier, Y Bastide, R Taouil, L Lakhal
BDA'1998 international conference on Advanced Databases, 177-196, 1998
1381998
Closed sets based discovery of small covers for association rules
N Pasquier, R Taouil, L Lakhal
BDA'1999 international conference on Advanced Databases, 361-381, 1999
1341999
Fast computation of concept lattices using data mining techniques
G Stumme, R Taouil, Y Bastide, N Pasquier, L Lakhal
1232000
Efficient mining of association rules based on formal concept analysis
L Lakhal, G Stumme
Formal concept analysis 3626, 180-195, 2005
1122005
Functional and approximate dependency mining: database and FCA points of view
S Lopes, JM Petit, L Lakhal
Journal of Experimental & Theoretical Artificial Intelligence 14 (2-3), 93-114, 2002
992002
Pascal: un algorithme d'extraction des motifs fréquents
Y Bastide, R Taouil, N Pasquier, G Stumme, L Lakhal
Revue des Sciences et Technologies de l'Information-Série TSI: Technique et …, 2002
832002
Mining bases for association rules using closed sets
R Taouil, N Pasquier, Y Bastide, L Lakhal
ICDE'2000 International Conference, 307, 2000
682000
Conceptual clustering with iceberg concept lattices
G Stumme, R Taouil, Y Bastide, L Lakhal
Proc. of GI-Fachgruppentreffen Maschinelles Lernen 1, 2001
672001
Essential patterns: A perfect cover of frequent patterns
A Casali, R Cicchetti, L Lakhal
Data Warehousing and Knowledge Discovery: 7th International Conference …, 2005
632005
iO2 An algorithmic method for building inheritance graphs in object database design
A Yahia, L Lakhal, R Cicchetti, JP Bordat
Conceptual Modeling—ER'96: 15th International Conference on Conceptual …, 1996
491996
Extracting semantics from data cubes using cube transversals and closures
A Casali, R Cicchetti, L Lakhal
Proceedings of the ninth ACM SIGKDD international conference on Knowledge …, 2003
412003
The system can't perform the operation now. Try again later.
Articles 1–20