. R. Agrawal, . T. Imelinsky, and . Swami, A, Mining association rules between sets of items in large database in proc, ACM SIGMOD'93 conf, pp.207-216, 1993.

A. Appice, M. Ceci, S. Rawles, and P. Flach, Redundant feature elimination for multi-class problems, Twenty-first international conference on Machine learning , ICML '04, pp.33-40, 2004.
DOI : 10.1145/1015330.1015397

E. Alphonse and C. Rouveirol, Lazy propositionalization for Relational Learning In Horn W, 14th European Conference on Artificial Intelligence, pp.256-260, 2000.

M. M. Barbut, Ordre et classification, Hachette, 1970.

. C. Berge, Graphes and Hypergraphes, Bordas, 1973.

. Birkhoof, Lattice theory, 1967.
DOI : 10.1090/coll/025

J. Bordat, Calcul pratique du treillis de Galois d'une correspondance, Math.Sci.humaines, vol.24, issue.96, pp.31-38, 1986.

A. L. Blum and P. Langley, Selection of relevant features and examples in machine learning, Artificial Intelligence, vol.97, issue.1-2, pp.245-271, 1997.
DOI : 10.1016/S0004-3702(97)00063-5

. L. Chaudron and . N. Maille, Generalized Formal Concept Analysis, Lecture notes in Artificial intelligence, pp.357-370, 1867.
DOI : 10.1007/10722280_25

. M. Chein, Algorithme de recherche de sous-matrice premiere d'une matrice, bull. math. R.S. Roumanie, vol.13, 1969.

D. J. Cook and L. B. Holder, Graph-based data mining, IEEE Intelligent Systems, vol.15, issue.2, pp.32-41, 2000.
DOI : 10.1109/5254.850825

. L. Dehaspe and . Toavonen, Discovery of frequent datalog patterns, Data Mining and Knowledge Discovery, vol.3, issue.1, pp.7-36, 1999.
DOI : 10.1023/A:1009863704807

. V. Duquenne, Latticial structures in data analysis, Theoretical Computer Science, vol.217, issue.2, pp.407-436, 1999.
DOI : 10.1016/S0304-3975(98)00279-5

B. Ganter, R. Wille, R. Godin, and R. Missaoui, « Formal concept analysis, mathematical foundation An incremental concept formation approach for learning from databases Theorical computer science, pp.133-387, 1994.

. B. Ganter and . S. Kuznetsov, Pattern Structures and Their Projections, Lecture notes in Artificial intelligence, 2002.
DOI : 10.1007/3-540-44583-8_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.7648

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

A. Inokuchi, T. Washio, and H. Motoda, Complete mining of Frequent patterns from Graphs : Mining Graph Data, Machine Learning, vol.50, issue.3, pp.321-354, 2003.
DOI : 10.1023/A:1021726221443

J. Kearns, The computational complexity of machine learning, p.176, 1994.

D. Koller and M. Sahami, Toward optimal feature selection, proceedings of the thirteenth international conference on machine learning, pp.284-292, 1996.

L. S. Kramer and . P. Flach, Propositionalization approaches to relational data mining Relational data mining, 2001.

Z. N. Lavrac and . P. Flach, RSD :Relational subgroup discovery through first-order feature construction Inductive logic programming conference, 2002.

N. Lavrac and P. Flach, An extended transformation approach to Inductive Logic programming. Mars Rapport de l'universite de Bristol. Departement of computer sciences, 2000.

. M. Liquière and . Sallantin, INNE : A structural learning algorithm for noisy Data, European Working Session on Learning, pp.111-123, 1989.

. M. Liquiere and . J. Sallantin, Structural machine learning with Galois lattice and Graphs, Machine Learning : Proceedings of the 1998 International Conferences, pp.305-313, 1998.

. M. Liquière, Du structurel au propositionnel, une approche formelle, 2001.

. J. Lloyd, A Logical Setting for the Unification of Attribute-Value and Relational Learning, 2000.

M. Nguifo and E. , Galois lattice, A framework for concept learning-design, evaluation and refinement, pp.461-467, 1994.

. M. Mugnier, Knowledge Representation and Reasonings Based on Graph Homomorphism, Proc. 8th Int Conf on Conceptual Structures, ICCS'2000, lecture notes in artificial intelligence, pp.172-192, 1867.
DOI : 10.1007/10722280_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.2987

S. Nijssen and J. Kok, A quickstart in frequent structure mining can make a difference, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, 2004.
DOI : 10.1145/1014052.1014134

E. M. Norris, An algorithm for computing the maximal rectangles of a binary relation, Journal of ACM, vol.21, pp.356-366, 1974.

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

G. D. Plotkin, A further note on inductive generalization, Machine intelligence, pp.101-124, 1971.

M. Ricordeau and Q. , Généralisation à l'aide de treillis de Galois dans l'apprentissage par renforcement RFIA, 2004.

. J. Sowa, Conceptual structures -information processing in mind and machine, 1984.

G. Stumme, R. Taouil, Y. Bastide, and L. Lakhal, Conceptual Clustering with Iceberg Concept Lattices, Proc. GI-Fachgruppentre :en Maschinelles Lernen '01, 2001.

. R. Wille, Knowledge acquisition by methods of formal concept analysis, Data analysis, Learning Symbolic and numeric knowledge, pp.365-380, 1989.

L. Yu and H. Liu, Efficiently handling feature redundancy in high-dimensional data, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.685-690, 2003.
DOI : 10.1145/956750.956840

. Zaki, SPADE : An efficient algorithm of mining frequent sequences, Machine Learning, vol.42, issue.1/2, pp.31-60, 2001.
DOI : 10.1023/A:1007652502315

. Zhou, Multiplicativity. Part I. Variations, multiplicative graphs, and digraphs, Journal of Graph Theory, vol.37, issue.5, pp.469-488, 1991.
DOI : 10.1002/jgt.3190150503