R. Agrawal, T. Imielinski, and A. Swami, Mining association rules between sets of items in large databases, Proceedings of SIGMOD Conference, pp.207-216, 1993.

R. Agrawal and R. Srikant, Fast algorithms for mining association rules, Proceedings of VLDB Conference, pp.478-499, 1994.

A. Arnauld and P. Nicole, La logique ou l'art de penser??contenant, outre les r e egles communes plusieurs, observations nouvelles, Ch Saveux, p.1668

Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. , Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets, Proceedings of the 1st International Conference on CL (6th International Conference on Database Systems) Computational Logic??CL, LNAI 1861, pp.972-986, 2000.
DOI : 10.1007/3-540-44957-4_65
URL : https://hal.archives-ouvertes.fr/hal-00467751

Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. , Mining frequent patterns with counting inference, ACM SIGKDD Explorations Newsletter, vol.2, issue.2, pp.71-80, 2000.
DOI : 10.1145/380995.381017
URL : https://hal.archives-ouvertes.fr/hal-00467750

R. J. Bayardo, Efficiently mining long patterns from databases, Proceedings of SIGMOD'98, pp.85-93, 1998.
DOI : 10.1145/276305.276313
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.1120

K. Becker, G. Stumme, R. Wille, U. Wille, and M. Zickwolff, Conceptual Information Systems Discussed through an IT-Security Tool, Proceedings of EKAW'00 Knowledge Engineering and Knowledge Management: Methods Models and Tools, LNAI 1937, pp.352-365, 2000.
DOI : 10.1007/3-540-39967-4_27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.2948

C. Carpineto and G. Romano, GALOIS : An order-theoretic approach to conceptual clustering, Proceedings ICML, Machine Learning, pp.33-40, 1993.
DOI : 10.1016/B978-1-55860-307-3.50011-3

R. Cole and G. Stumme, CEM: a conceptual e-mail manager, Proceedings ICCS'00 Conceptual Structures: Logical, Linguistic, and Computational Issues, LNAI 1867, pp.438-452, 2000.

B. Ganter and K. Reuter, Finding all closed sets: A general approach, Order, vol.2, issue.3, pp.283-290, 1991.
DOI : 10.1007/BF00383449

B. Ganter, R. Wille13, ]. R. Godin, H. Mili, G. Mineau et al., Formal Concept Analysis: Mathematical Foundations, Design of class hierarchies based on concept Galois lattices, pp.117-134, 1998.

R. Godin and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science, vol.133, issue.2, pp.387-419, 1994.
DOI : 10.1016/0304-3975(94)90195-3

T. Gruber, Toward principles for the design of ontologies used for knowledge sharing?, International Journal of Human-Computer Studies, vol.43, issue.5-6, pp.293-310, 1997.
DOI : 10.1006/ijhc.1995.1081

J. Hereth, G. Stumme, U. Wille, and R. Wille, Conceptual Knowledge Discovery and Data Analysis, Proceedings ICCS2000 Conceptual Structures: Logical, Linguistic, and Computational Structures, LNAI 1867, pp.421-437, 2000.
DOI : 10.1007/10722280_29

Y. Huhtala, J. , P. Porkka, and H. Toivonen, Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies, The Computer Journal, vol.42, issue.2, pp.100-111, 1999.
DOI : 10.1093/comjnl/42.2.100

J. Kivinen and H. Mannila, Approximate inference of functional dependencies from relations, Theoretical Computer Science, vol.149, issue.1, pp.129-149, 1995.
DOI : 10.1016/0304-3975(95)00028-U

M. Krone and G. Snelting, On the inference of configuration structures from source code, Proceedings of 16th International Conference on Software Engineering, pp.49-57, 1994.
DOI : 10.1109/ICSE.1994.296765

. Ch and C. Lindig, Open Source implementation of concept analysis in C), 1997.

S. Lopes, J. Petit, and L. , Efficient discovery of functional dependencies and Amstrong relations, Proceedings EDBT 2000, pp.350-364, 2000.

M. Luxenburger, Implications partielles dans un contexte, Informatique et Sciences Humaines, vol.29, issue.113, pp.35-55, 1991.

K. Mackensen and U. Wille, Qualitative text analysis supported by conceptual data systems, Quality and Quantity, International Journal of Methodology, vol.2, issue.33, pp.135-156, 1999.

A. and S. Staab, Mining ontologies from text, Proceedings EKAW'00 Knowledge Engineering and Knowledge Management: Methods, Models, and Tools, LNAI 1937, pp.189-202, 2000.

H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Mining and Knowledge Discovery, vol.1, issue.3, pp.241-258, 1997.
DOI : 10.1023/A:1009796218281

R. S. Michalski, Knowledge acquisition through conceptual clustering: a theoretical framework and an algorithm for partitioning data into conjunctive concepts, Policy Analysis and Information Systems, vol.4, issue.3, pp.219-244, 1980.

G. Mineau and R. Godin, Automatic structuring of knowledge bases by conceptual clustering, IEEE Transactions on Knowledge and Data Engineering, vol.7, issue.5, pp.824-829, 1995.
DOI : 10.1109/69.469834

M. Missikoff and M. Scholl, An algorithm for insertion into a lattice: Application to type classification, Proceedings rd International Conference FODO 1989, pp.64-82, 1989.
DOI : 10.1007/3-540-51295-0_119

L. Nourine and O. Raynaud, A fast algorithm for building lattices, Information Processing Letters, vol.71, issue.5-6, pp.199-204, 1999.
DOI : 10.1016/S0020-0190(99)00108-8

N. Pasquier, Y. Bastide, R. Taouil, and L. , Pruning closed itemset lattices for association rules, 14 e emes Journes Bases de Donnes Avances (BDA'98), pp.26-30, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00467745

N. Pasquier, Y. Bastide, R. Taouil, and L. , Efficient mining of association rules using closed itemset lattices, Information Systems, vol.24, issue.1, pp.25-46, 1999.
DOI : 10.1016/S0306-4379(99)00003-4

N. Pasquier, Y. Bastide, R. Taouil, and L. , Discovering Frequent Closed Itemsets for Association Rules, Proceedings ICDT'98, pp.398-416, 1999.
DOI : 10.1007/3-540-49257-7_25
URL : https://hal.archives-ouvertes.fr/hal-00467747

J. Pei, J. Han, and R. Mao, CLOSET: An efficient algorithm for mining frequent closed itemsets, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp.21-30, 2000.

P. Scheich, M. Skorsky, F. Vogt, C. Wachter, and R. Wille, Conceptual Data Systems, Information and Classification, pp.72-84, 1993.
DOI : 10.1007/978-3-642-50974-2_8

I. Schmitt and G. Saake, Merging inheritance hierarchies for database integration, Proceedings 3rd IFCIS International Conference on Cooperative Information Systems (Cat No 98EX122) COOPIS-98, pp.20-22, 1998.
DOI : 10.1109/COOPIS.1998.706276

G. Snelting and F. Tip, Reengineering class hierarchies using concept analysis, Proceedings ACM SIGSOFT Symposium on the Foundations of Software Engineering, pp.99-110, 1998.
DOI : 10.1145/288195.288273
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.9845

S. Strahringer and R. Wille, Conceptual Clustering via Convex-Ordinal Structures, Information and Classification, pp.85-98, 1993.
DOI : 10.1007/978-3-642-50974-2_9

G. Stumme and A. Mdche, bottom-up merging of ontologies, Proceedings 17th International Conference on Artificial Intelligence (IJCAI'01), pp.225-230, 2001.

G. Stumme, R. Taouil, Y. Bastide, and L. , Conceptual clustering with iceberg concept lattices, Proceedings of GI?Fachgruppentreffen Maschinelles Lernen'01, 2001.

G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, and L. , Fast computation of concept lattices using data mining techniques, Proceedings 7th International Workshop on Knowledge Representation Meets Databases, pp.21-22, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00099288

G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, and L. , Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis, Proceedings KI 2001 LNAI 2174, pp.335-350, 2001.
DOI : 10.1007/3-540-45422-5_24
URL : https://hal.archives-ouvertes.fr/inria-00100665

G. Stumme, R. Wille, and U. Wille, Conceptual Knowledge Discovery in Databases using formal concept analysis methods, Proceedings 2nd European Symposium on PKDD'98 Principles of Data Mining and Knowledge Discovery, LNAI 1510, pp.450-458, 1998.
DOI : 10.1007/BFb0094849

F. Vogt and R. Wille, TOSCANA ??? A graphical tool for analyzing and exploring data, LNCS, vol.894, pp.226-233, 1995.
DOI : 10.1007/3-540-58950-3_374

K. Waiyamai, R. Taouil, and L. , Towards an object database approach for managing concept lattices, Proceedings 16th International Conference on Conceptual Modeling, pp.299-312, 1997.
DOI : 10.1007/3-540-63699-4_24

R. Wille, Restructuring lattice theory: an approach based on hierarchies of concepts, Ordered Sets, pp.445-470, 1982.

R. Wille, Line diagrams of hierarchical concept systems, Int. Classif, vol.11, pp.77-86, 1984.

R. Wille, Concept lattices and conceptual knowledge systems, Computers & Mathematics with Applications, vol.23, issue.6-9, pp.493-515, 1992.
DOI : 10.1016/0898-1221(92)90120-7
URL : http://doi.org/10.1016/0898-1221(92)90120-7

S. Wrobel, K. Morik, and T. Joachims, 12 Maschinelles Lernen und Data Mining, Handbuch der Knstlichen Intelligenz, pp.517-597, 2000.
DOI : 10.1524/9783486719796.405

A. Yahia, L. Lakhal, J. P. Bordat, and R. Cicchetti, IO2 an algorithmic method for building inheritance graphs in object database design, Proceedings 15th International Conference on Conceptual Modeling, pp.422-437, 1996.
DOI : 10.1007/BFb0019938