R. Agrawal, T. Imielinski, and A. Swami, Mining association rules between sets of items in large databases, Proceedings of the ACM SIGMOD Int'l Conference on Management of Data, pp.207-216, 1993.

R. Agrawal and R. Srikant, Fast algorithms for mining association rules, Proceedings of the 20th Int'l Conference on Very Large Data Bases, pp.478-499, 1994.

R. J. Bayardo, EEciently mining long patterns from databases, Proceedings of the ACM SIGMOD Int'l Conference on Management of Data, pp.85-93, 1998.

G. Birkhoo, Lattices theory, Coll. Pub. XXV, 1967.

S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, Dynamic itemset counting and implication rules for market basket data, Proceedings of the ACM SIGMOD Int'l Conference on Management of Data, pp.255-264, 1997.

M. Chen, J. Han, and P. S. Yu, Data mining: an overview from a database perspective, IEEE Transactions on Knowledge and Data Engineering, vol.8, issue.6, pp.866-883, 1996.
DOI : 10.1109/69.553155

B. A. Davey and H. A. Priestley, Introduction to Lattices and Order, 1994.
DOI : 10.1017/CBO9780511809088

V. Duquenne and L. Guigues, Famille minimale d'implication informatives r esultant d'un tableau de donn ees binaires, Math. Sci. Hum, vol.24, issue.95, pp.5-18, 1986.

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

D. Lin and Z. M. Kedem, Pincer-search: A new algorithm for discovering the maximum frequent set, Proceedings of the 6th Int'l Conference on Extending Database Technology, pp.105-119, 1998.
DOI : 10.1007/BFb0100980

M. Luxenburger, Implications partielles dans un contexte, Math. Inf. Sci. Hum, vol.29, issue.113, pp.35-55, 1991.

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

H. Mannila, H. Toivonen, and A. I. Verkamo, EEcient algorithms for discovering association rules, Proceedings of the AAAI Workshop on Knowledge Discovery in Databases, pp.181-192, 1994.

A. M. Mueller, Fast sequential and parallel algorithms for association rules mining: A comparison, 1995.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Pruning closed itemset lattices for association rules, Proceedings of the BDA French Conference on Advanced Databases, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00467745

A. Savasere, E. Omiecinski, and S. Navathe, An eecient algorithm for mining association rules in larges databases, Proceedings of the 21th Int'l Conference on Very Large Data Bases, pp.432-444, 1995.

H. Toivonen, Sampling large databases for association rules, Proceedings of the 22nd Int'l Conference on Very Large Data Bases, pp.134-145, 1996.

H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hatonen, and H. Mannila, Pruning and grouping discovered association rules, ECML-95 Workshop on Statistics Machine Learning, and Knowledge Discovery in Databases, pp.47-52, 1995.

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

M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, New algorithms for fast discovery of association rules, Proceedings of the 3rd Int'l Conference on Knowledge Discovery in Databases, pp.283-286, 1997.