Lotfi LAKHAL
Lotfi LAKHAL
Full Professor of Computer Science, Aix-Marseille Université
Zweryfikowany adres z univ-amu.fr - Strona główna
TytułCytowane przezRok
Discovering frequent closed itemsets for association rules
N Pasquier, Y Bastide, R Taouil, L Lakhal
International Conference on Database Theory, 398-416, 1999
18861999
Efficient mining of association rules using closed itemset lattices
N Pasquier, Y Bastide, R Taouil, L Lakhal
Information systems 24 (1), 25-46, 1999
10481999
Computing iceberg concept lattices with TITANIC
G Stumme, R Taouil, Y Bastide, N Pasquier, L Lakhal
Data & knowledge engineering 42 (2), 189-222, 2002
5392002
Mining minimal non-redundant association rules using frequent closed itemsets
Y Bastide, N Pasquier, R Taouil, G Stumme, L Lakhal
International Conference on Computational Logic, 972-986, 2000
4462000
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
4092000
Efficient discovery of functional dependencies and armstrong relations
S Lopes, JM Petit, L Lakhal
International Conference on Extending Database Technology, 350-364, 2000
2282000
Generating a condensed representation for association rules
N Pasquier, R Taouil, Y Bastide, G Stumme, L Lakhal
Journal of intelligent information systems 24 (1), 29-60, 2005
2212005
Pruning closed itemset lattices for association rules
N Pasquier, Y Bastide, R Taouil, L Lakhal
1291998
Intelligent structuring and reducing of association rules with formal concept analysis
G Stumme, R Taouil, Y Bastide, N Pasquier, L Lakhal
Annual Conference on Artificial Intelligence, 335-350, 2001
1272001
Fast computation of concept lattices using data mining techniques
G Stumme, R Taouil, Y Bastide, N Pasquier, L Lakhal
1152000
Closed sets based discovery of small covers for association rules
N Pasquier, Y Bastide, R Taouil, L Lakhal
1151999
Contrast data mining: concepts, algorithms, and applications
G Dong, J Bailey
CRC Press, 2012
1062012
Efficient mining of association rules based on formal concept analysis
L Lakhal, G Stumme
Formal concept analysis, 180-195, 2005
952005
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
862002
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface
D Ünay, Z Çataltepe, S Aksoy
Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2010
792010
Pascal: un algorithme d'extraction des motifs fréquents
Y Bastide, R Taouil, N Pasquier, G Stumme, L Lakhal
742002
Conceptual clustering with iceberg concept lattices
G Stumme, R Taouil, Y Bastide, L Lakhal
Proc. of GI-Fachgruppentreffen Maschinelles Lernen 1, 2001
582001
Mining bases for association rules using closed sets
R Taouil, N Pasquier, Y Bastide, L Lakhal
562000
Essential patterns: A perfect cover of frequent patterns
A Casali, R Cicchetti, L Lakhal
International Conference on Data Warehousing and Knowledge Discovery, 428-437, 2005
552005
iO2 An algorithmic method for building inheritance graphs in object database design
A Yahia, L Lakhal, R Cicchetti, JP Bordat
International Conference on Conceptual Modeling, 422-437, 1996
461996
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20