A. R. Imielinski-t and . Swami-a, Mining Association Rules Between Sets of Items in Large Databases, Proc. of the ACM SIGMOD Conference, pp.207-216, 1993.

A. R. Agrawal and . Srikant-r, Fast Algorithms for Mining Association Rules, Proc. of the 20th VLDB Conference, pp.478-499, 1994.

B. E. Psaila-g, Designing Templates for Mining Association Rules, Journal of Intelligent Information Systems, vol.9, issue.1, pp.7-32, 1997.

. Y. Bastide, . Pasquier-n, . Taouil-r, . Stumme-g, and . Lakhal-l, Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets, Proc. of the 6th DOOD Conference, 2000.
DOI : 10.1007/3-540-44957-4_65
URL : https://hal.archives-ouvertes.fr/hal-00467751

A. J. Bayardo-r, 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

A. J. Bayardo-r and G. D. , Constraint-based rule mining in large, dense databases, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337), pp.188-197, 1999.
DOI : 10.1109/ICDE.1999.754924

. Bir and . G. Birkhoff, Lattices Theory, 1967.

. S. Brin, . Motwani-r, and . Silverstein-c, Beyond Market Baskets: Generalizing Association Rules to Correlation, Proc. of the ACM SIGMOD Conference, pp.265-276, 1997.

. S. Brin, U. J. Motwani-r, and T. S. , Dynamic Itemset Counting and Implication Rules for Market Basket Data, Proc. of the ACM SIGMOD Conference, pp.255-264, 1997.

. J. Demetrovics, . Libkin-l, and . B. Muchnik-i, Functional dependencies in relational databases: A lattice point of view, Discrete Applied Mathematics, vol.40, issue.2, pp.155-185, 1992.
DOI : 10.1016/0166-218X(92)90028-9

. B. Gan-91-]-ganter and . Reuter-k, Finding all closed sets: A general approach, Order, vol.2, issue.3, pp.283-290, 1991.
DOI : 10.1007/BF00383449

. B. Gan-99-]-ganter and . Wille-r, Formal Concept Analysis: Mathematical Foundations, 1999.

H. J. Fu-y, Discovery of Multiple-Level Association Rules from Large Databases, Proc. of the 21st VLDB Conference, pp.420-431, 1995.

. D. Heckerman, Bayesian networks for knowledge discovery Advances in Knowledge Discovery and Data Mining, pp.273-305, 1996.

H. Y. , K. J. Porkka-p, and . Toivonen-h, Efficient Discovery of Functional and Approximate Dependencies Using Partitions, Proc. of the 14th ICDE Conference, pp.392-401, 1998.

M. M. Klemettinen, R. P. Toivonen-h, and . I. Verkamo-a, 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

L. D. Kedem-z, Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set, Proc. of the 6th EDBT Conference, pp.105-119, 1998.

. Liu, . Liu-b, and C. S. Hsu-w, Using General Impressions to Analyse Discovered Classification Rules, Proc. of the 3rd KDD Conference, pp.31-36, 1997.

L. S. and P. Lakhal-l, Efficient Discovery of Functional Dependencies and Armstrong Relations, Proc. of the 7th EDBT Conference, 2000.

M. R. Psaila-g and C. S. , A New SQL-like Operator for Mining Association Rules, Proc. of the 22nd VLDB Conference, pp.122-133, 1996.

. Morimoto-y, . Fukuda-t, . Matsuzawa-h, and Y. K. Tokuyama-t, Algorithms for mining association rules for binary segmentations of huge categorical databases, Proc. of the 24nd VLDB Conference, pp.380-391, 1998.

N. R. Lakshmanan-v and H. J. Pang, Exploratory Mining and Pruning Optimizations of Constrained Association Rules, Proc. of the ACM SIGMOD Conference, pp.13-24, 1998.

P. N. Bastide-y, . Taouil-r, and . Lakhal-l, Pruning closed itemset lattices for association rules, Proc. of the 14th BDA Conference, pp.177-196, 1998.

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

S. A. Omiecinski-e and N. S. , An Efficient Algorithm for Mining Association Rules in Larges Databases, Proc. of the 21st VLDB Conference, pp.432-444, 1995.

S. A. Tuzhilin-a, What Makes Patterns Interesting in Knowledge Discovery Systems, IEEE Transactions on Knowledge and Data Engineering, vol.8, issue.6, pp.970-974, 1996.

S. C. Brin-s and . Motwani-r, Beyond market baskets: Generalizing association rules to dependence rules, Data Mining and Knowledge Discovery, vol.2, issue.1, pp.39-68, 1998.

S. R. Vu-q and A. R. , Mining Association Rules with Item Constraints, Proc. of the 3rd KDD Conference, pp.67-73, 1997.

. H. Toivonen, R. P. Klemettinen-m, and M. H. Hätönen-k, Pruning and Grouping of Discovered Association Rules, Notes of the ECML'95 Workshop, pp.47-52, 1995.

. H. Toivonen, Sampling Large Databases for Association Rules, Proc. of the 22nd VLDB Conference, pp.134-145, 1996.

. 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

Z. M. Parthasarathy-s and L. W. Ogihara-m, New Algorithms for Fast Discovery of Association Rules, Proc. of the 3rd KDD Conference, pp.283-286, 1997.