| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Lakhal, L. & Stumme, G. | Efficient Mining of Association Rules Based on Formal Concept Analysis | 2005 | Formal Concept Analysis: Foundations and Applications Ganter, B.; Stumme, G. & Wille, R. (ed.) |
inbook | URL |
| Pasquier, N., Taouil, R., Bastide, Y., Stumme, G. & Lakhal, L. | Generating a Condensed Representation for Association Rules | 2005 | Journal Intelligent Information Systems (JIIS) | article | URL |
| Stumme, G. | Efficient Data Mining Based on Formal Concept Analysis | 2002 | Database and Expert Systems Applications. Proc. DEXA 2002 Hameurlain, A.; Cicchetti, R. & Traunmüller, R. (ed.) |
inproceedings | URL |
| Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. & Lakhal, L. | Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis | 2001 | KI 2001: Advances in Artificial Intelligence. KI 2001 Baader, F.; Brewker, G. & Eiter, T. (ed.) |
inproceedings | URL |
| Bastide, Y., Taouil, R., Pasquier, N., Stumme, G. & Lakhal, L. | Levelwise Search of Frequent Patterns | 2000 | Actes des 16ièmes Journées Bases de Données Avancées | inproceedings | URL |
| Bastide, Y., Taouil, R., Pasquier, N., Stumme, G. & Lakhal, L. | Mining Frequent Patterns with Counting Inference. | 2000 | SIGKDD Explorations, Special Issue on Scalable Algorithms | article | |
| Bastide, Y., Pasquier, N., Taouil, R., Stumme, G. & Lakhal, L. | Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets | 2000 | Computational Logic --- CL 2000 Proc. CL'00 Lloyd, J.; Dahl, V.; Furbach, U.; Kerber, M.; Laus, K.-K.; Palamidessi, C.; Pereira, L.; Sagiv, Y. & Stuckey, P. (ed.) |
inproceedings | URL |
| Boulicaut, J.-F., Bykowski, A. & Rigotti, C. | Approximation of Frequency Queris by Means of Free-Sets | 2000 | Principles of Data Mining and Knowledge Discovery | inproceedings | URL |
| Stumme, G. | Conceptual Knowledge Discovery with Frequent Concept Lattices | 1999 | techreport | URL | |
| Pasquier, N., Bastide, Y., Taouil, R. & Lakhal, L. | Pruning closed itemset lattices for associations rules. | 1998 | Bases de Donn�es Avanc�es Bouzeghoub, M. (ed.) |
inproceedings | URL |
| Pasquier, N., Bastide, Y., Taouil, R. & Lakhal, L. | Pruning closed itemset lattices for associations rules. | 1998 | Bases de Données Avancées Bouzeghoub, M. (ed.) |
inproceedings | URL |
Created by JabRef export filters on 25/04/2024 by the social publication management platform PUMA