F. Angiulli, G. Ianni, and L. Palopoli, On the complexity of mining association rules, Proceedings of the SEBD conference, pp.177-184, 2001.

W. W. Armstrong, Dependency structures of data base relationships, Proceedings of the IFIP congress, pp.580-583, 1974.

E. Baralis and G. Psaila, Designing templates for mining association rules, Journal of Intelligent Information Systems, vol.9, issue.1, pp.7-32, 1997.
DOI : 10.1023/A:1008637019359

Y. Bastide, N. Pasquier, R. Taouil, L. Lakhal, and G. Stumme, Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets, Proceedings of the CL conference, pp.972-986, 2000.
DOI : 10.1007/3-540-44957-4_65
URL : https://hal.archives-ouvertes.fr/hal-00467751

Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal, Mining frequent patterns with counting inference, SIGKDD Explorations, pp.66-75, 2000.
DOI : 10.1145/380995.381017
URL : https://hal.archives-ouvertes.fr/hal-00467750

R. J. Bayardo and R. Agrawal, Mining the most interesting rules, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '99, pp.145-154, 1999.
DOI : 10.1145/312129.312219

R. J. Bayardo, R. Agrawal, and D. Gunopulos, Constraint-based rule mining in large, dense databases, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337), pp.217-240, 2000.
DOI : 10.1109/ICDE.1999.754924

B. Yahia, S. Hamrouni, T. Nguifo, and E. M. , Frequent closed itemset based algorithms, ACM SIGKDD Explorations Newsletter, vol.8, issue.1, pp.93-104, 2006.
DOI : 10.1145/1147234.1147248
URL : https://hal.archives-ouvertes.fr/hal-00109569

F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi, Efficient breadth-first mining of frequent pattern with monotone constraints, Knowledge and Information Systems, vol.32, issue.2, pp.131-153, 2005.
DOI : 10.1007/s10115-004-0164-7

F. Bonchi and C. Lucchese, On Closed Constrained Frequent Pattern Mining, Fourth IEEE International Conference on Data Mining (ICDM'04), pp.35-42, 2004.
DOI : 10.1109/ICDM.2004.10093

F. Bonchi and C. Lucchese, On condensed representations of constrained frequent patterns, Knowledge and Information Systems, vol.9, issue.2, pp.180-201, 2006.
DOI : 10.1007/s10115-005-0201-1

J. F. Boulicaut, A. Bykowski, and C. Rigotti, Free-sets: A condensed representation of boolean data for the approximation of frequency queries, Data Mining and Knowledge Discovery, vol.7, issue.1, pp.5-22, 2003.
DOI : 10.1023/A:1021571501451
URL : https://hal.archives-ouvertes.fr/hal-01503814

J. F. Boulicaut and B. Jeudy, Optimization of association rule mining queries, Intelligent Data Analysis Journal, vol.6, pp.341-357, 2002.

S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, Dynamic itemset counting and implication rules for market basket data, Proceedings ACM SIGMOD conference, pp.255-264, 1997.

T. Brijs, K. Vanhoof, and G. Wets, Defining interestingness for association rules, International Journal of Information Theories and Applications, vol.10, issue.4, pp.370-376, 2003.

A. Ceglar and J. F. Roddick, Association mining, ACM Computing Surveys, vol.38, issue.2, 2006.
DOI : 10.1145/1132956.1132958

R. Cheng, J. Ke, Y. Ng, and W. , Effective elimination of redundant association rules, Data Mining and Knowledge Discovery, vol.9, issue.3, pp.221-249, 2008.
DOI : 10.1007/s10618-007-0084-8

P. Chen, R. Verma, J. C. Meininger, and W. Chan, Semantic analysis of association rules, Proceedings of the FLAIRS Conference, 2008.

Y. Cheung and A. Fu, Mining frequent itemsets without support threshold: with and without item constraints, IEEE Transactions on Knowledge and Data Engineering, vol.16, issue.9, pp.1052-1069, 2004.
DOI : 10.1109/TKDE.2004.44

L. Cristofor and D. A. Simovici, Generating an informative cover for association rules, 2002 IEEE International Conference on Data Mining, 2002. Proceedings., 2002.
DOI : 10.1109/ICDM.2002.1184007

J. S. Deogun and L. Jiang, SARM ??? Succinct Association Rule Mining: An Approach to Enhance Association Mining, Proceedings ISMIS conference, pp.121-130, 2005.
DOI : 10.1007/11425274_13

G. Dong, C. Jiang, J. Pei, J. Li, and L. Wong, Mining Succinct Systems of Minimal Generators of Formal Concepts, Proceeding of the DASFAA conference, pp.175-187, 2005.
DOI : 10.1007/11408079_17

V. Duquenne and J. Guigues, Famille minimale d'implications informatives résultant d'un tableau de données binaires, Mathématiques et Sciences Humaines, issue.95, pp.24-29, 1986.

A. Freitas, On rule interestingness measures. Knowledge-Based Systems, pp.309-315, 1999.

D. R. Carvalho, A. A. Freitas, and N. F. Ebecken, Evaluating the Correlation Between Objective Rule Interestingness Measures and Real Human Interest, Proceedings of the PKDD conference, pp.453-461, 2005.
DOI : 10.1007/11564126_45

G. Gasmi, S. Ben-yahia, E. M. Nguifo, and Y. Slimani, $\mathcal{IGB}$ : A New Informative Generic Base of Association Rules, Proceedings of the PAKDD conference, pp.81-90, 2005.
DOI : 10.1007/11430919_11

L. Geng and H. J. Hamilton, Interestingness measures for data mining, ACM Computing Surveys, vol.38, issue.3, 2006.
DOI : 10.1145/1132960.1132963

T. Hamrouni, S. Ben-yahia, and E. Nguifo, Generic Association Rule Bases: Are They so Succinct?, Proceedings of the CLA conference, pp.198-213, 2006.
DOI : 10.1007/978-3-540-78921-5_13
URL : https://hal.archives-ouvertes.fr/hal-00121121

T. Hamrouni, S. Ben-yahia, E. Mephu-nguifo, and P. Valtchev, About the Lossless Reduction of the Minimal Generator Family of a Context, Proceedings of the ICFCA conference, pp.130-150, 2007.
DOI : 10.1007/978-3-540-70901-5_9
URL : https://hal.archives-ouvertes.fr/hal-00261257

T. Hamrouni, S. Ben-yahia, and E. Nguifo, Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions, Lecture Notes in Computer Science, vol.4923, pp.80-95, 2008.
DOI : 10.1007/978-3-540-78921-5_5
URL : https://hal.archives-ouvertes.fr/hal-00121124

J. Han and Y. Fu, Discovery of multiplelevel association rules from large databases, Proceedings of the VLDB conference, pp.420-431, 1995.

R. Hilderman and H. Hamilton, Heuristic measures of interestingness, Proceedings of the PKDD conference, pp.232-241, 1999.

R. Hilderman and H. Hamilton, Knowledge Discovery and Measures of Interest, 2001.
DOI : 10.1007/978-1-4757-3283-2

F. Hussain, H. Liu, E. Suzuki, and H. Lu, Exception Rule Mining with a Relative Interestingness Measure, Proceedings of the PAKDD conference, pp.86-97, 2000.
DOI : 10.1007/3-540-45571-X_11

S. Jaroszewicz and T. Scheffer, Frequent Closed Itemsets Based Condensed Representations for Association Rules Fast discovery of unexpected patterns in data relative to a bayesian network, Proceeding of the ACM SIGKDD conference, pp.118-127, 2005.

M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo, Finding interesting rules from large sets of discovered association rules, Proceedings of the third international conference on Information and knowledge management , CIKM '94, pp.401-407, 1994.
DOI : 10.1145/191246.191314

M. Kryszkiewicz, Representative association rules and minimum condition maximum consequence association rules, Proceedings of the PKDD conference LNCS 1510, pp.361-369, 1998.
DOI : 10.1007/BFb0094839

M. Kryszkiewicz, Concise Representations of Association Rules, Lecture Notes in Computer Science, vol.2447, pp.187-203, 2002.
DOI : 10.1007/3-540-45728-3_8

L. Lakshmanan, R. Ng, J. Han, and A. Pang, Optimization of constrained frequent set queries with 2-variable constraints, Proceeding of the ACM SIGMOD international conference, pp.157-168, 1999.

P. Lenca, P. Meyer, B. Vaillant, and S. Lallich, On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid, European Journal of Operational Research, vol.184, issue.2, pp.610-626, 2008.
DOI : 10.1016/j.ejor.2006.10.059

C. Leung, L. Lakshmanan, and R. Ng, Exploiting succinct constraints using FP-trees, ACM SIGKDD Explorations Newsletter, vol.4, issue.1, 2002.
DOI : 10.1145/568574.568581

J. Li, B. Tang, and N. Cercone, Applying Association Rules for Interesting Recommendations Using Rule Templates, Proceedings of the PAKDD conference, pp.166-170, 2004.
DOI : 10.1007/978-3-540-24775-3_21

B. Liu, W. Hsu, L. Mun, and H. Lee, Finding interesting patterns using user expectations, Knowledge and Data Engineering, vol.11, issue.6, pp.817-832, 1999.

B. Liu, W. Hsu, and S. Chen, Using general impressions to analyze discovered classification rules, Proceedings of the KDD conference, pp.31-36, 1997.

B. Liu, W. Hsu, and Y. Ma, Pruning and summarizing the discovered associations, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '99, pp.125-134, 1999.
DOI : 10.1145/312129.312216

H. Liu, H. Lu, L. Feng, and F. Hussain, Efficient Search of Reliable Exceptions, Proceedings of the PAKDD conference, pp.194-204, 1999.
DOI : 10.1007/3-540-48912-6_27

G. Liu, J. Li, and W. Limsoon, A new concise representation of frequent itemsets using generators and a positive border, Knowledge and Information Systems, vol.7, issue.4, 2007.
DOI : 10.1007/s10115-007-0111-5

N. Lu, C. Wang-zhe, and . Zhou, Research on association rule mining algorithms with item constraints, Proceedings of the CW conference, 2005.

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

K. Mcgarry, A survey of interestingness measures for knowledge discovery. The Knowledge Engineering Review, 2005.

D. Maier, The theory of Relational Databases, 1983.

C. J. Matheus, P. K. Chan, and G. Piatetsky-shapiro, Systems for knowledge discovery in databases, IEEE Transactions on Knowledge and Data Engineering, vol.5, issue.6, pp.903-913, 1993.
DOI : 10.1109/69.250073

R. Ng, L. Lakshmanan, J. Han, and . Pang, Exploratory mining and pruning optimizations of constrained associations rules, Proceeding of the ACM SIGMOD conference, pp.13-24, 1998.

B. Padmanabhan and A. Tuzhilin, Frequent Closed Itemsets Based Condensed Representations for Association Rules A belief driven method for discovering unexpected patterns, Proceedings of the KDD conference, pp.94-100, 1998.

B. Padmanabhan and A. Tuzhilin, Small is beautiful, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.54-63, 2000.
DOI : 10.1145/347090.347103

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Pruning closed itemset lattices for association rules, Proceedings of the BDA conference, pp.177-196, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00467745

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, 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. Lakhal, Discovering Frequent Closed Itemsets for Association Rules, Proceedings of the ICDT conference, pp.398-416, 1999.
DOI : 10.1007/3-540-49257-7_25
URL : https://hal.archives-ouvertes.fr/hal-00467747

N. Pasquier, R. Taouil, Y. Bastide, G. Stumme, and L. Lakhal, Generating a Condensed Representation for Association Rules, Journal of Intelligent Information Systems, vol.8, issue.6, pp.29-60, 2005.
DOI : 10.1007/s10844-005-0266-z
URL : https://hal.archives-ouvertes.fr/hal-00363015

N. Pasquier, Mining association rules using frequent closed itemsets, Encyclopedia of Data Warehousing and Mining, pp.752-757, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00363019

. J. Pei and J. Han, Constrained frequent pattern mining, ACM SIGKDD Explorations Newsletter, vol.4, issue.1, pp.31-39, 2002.
DOI : 10.1145/568574.568580

J. Pfaltz and C. Taylor, Closed set mining of biological data, Proceedings of the BioKDD conference, pp.43-48, 2002.

G. Piatetsky-shapiro, Discovery, analysis, and presentation of strong rules, AAAI, pp.229-248, 1991.

G. Piatetsky-shapiro and C. Matheus, The interestingness of deviations, Proceedings of the KDD conference, pp.25-36, 1994.

A. Silberschatz and A. Tuzhilin, What makes patterns interesting in knowledge discovery systems, IEEE Transactions on Knowledge and Data Engineering, vol.8, issue.6, pp.970-974, 1996.
DOI : 10.1109/69.553165

C. Silverstein, S. Brin, R. Motwani, and J. D. Ullman, Scalable techniques for mining causal structures, Data Mining and Knowledge Discovery, vol.4, issue.2/3, pp.163-192, 2000.
DOI : 10.1023/A:1009891813863

R. Srikant and A. Agrawal, Mining generalized association rules, Proceedings of the VLDB conference, pp.407-419, 1995.
DOI : 10.1016/S0167-739X(97)00019-8

R. Srikant, Q. Vu, and R. Agrawal, Mining association rules with item constraints, Proceedings of the KDD conference, pp.67-73, 1997.

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

P. Tan, V. Kumar, and J. Srivastava, Selecting the right interestingness measure for association patterns, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, pp.32-41, 2002.
DOI : 10.1145/775047.775053

H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hätönen, and H. Mannila, Pruning and grouping discovered association rules, Proceedings of the ECML workshop, pp.47-52, 1995.

P. Valtchev, R. Missaoui, and R. Godin, Formal Concept Analysis for Knowledge Discovery and Data Mining: The New Challenges, Lecture Notes in Computer Science, pp.2961-352, 2004.
DOI : 10.1007/978-3-540-24651-0_30