. Nous-pensons-qu, une perspective intéressante de travaux ultérieurs concerne l'intégration du comptage par inférence dans les systèmes de gestion de bases de données

. Bibliographie, R. Agrawal, T. Imielinski, and A. Swami, « Mining Association Rules between sets of Items in Large Databases, Proc. ACM SIGMOD Int'l Conf. on Management of Data, pp.207-216, 1993.

R. Agrawal and R. Srikant, « Fast Algorithms for Mining Association Rules in Large Databases, Proc. of the 20th Int'l Conf. on Very Large Data Bases (VLDB), juin 1994, pp.478-499

R. Agrawal and R. Srikant, Mining sequential patterns, Proceedings of the Eleventh International Conference on Data Engineering, pp.3-14, 1995.
DOI : 10.1109/ICDE.1995.380415

Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal, Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets, Proc. of the 1st Int'l Conf. on Computational Logic (6th Int'l Conf. on Database Systems ? DOOD), n o 1861 Lectures Notes in Artificial Intelligence, 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. Lakhal, « Levelwise search of frequent patterns with counting inference, Actes des 16 es journées « Bases de données avancées, pp.307-322, 2000.

R. J. Bayardo, « Efficiently Mining Long Patterns from Databases, Proc. ACM SIGMOD Int'l Conf. on Management of Data, pp.85-93, 1998.

R. 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
DOI : 10.1145/312129.312219
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.573.5706

J. Boulicaut and A. Bykowski, Frequent Closures as a Concise Representation for Binary Data Mining, Proc. of the 4th PAKDD Conf, pp.62-73, 2000.
DOI : 10.1007/3-540-45571-X_9

J. Boulicaut, A. Bykowski, and C. Rigotti, Approximation of Frequency Queries by Means of Free-Sets, Proc. of the 4th PKDD Conf., septembre, pp.75-85, 2000.
DOI : 10.1007/3-540-45372-5_8

S. Brin, R. Motwani, and C. Silverstein, « Beyond Market Baskets: Generalizing Association Rules to Correlation, Proc. ACM SIGMOD Int'l Conf. on Management of Data, pp.265-276, 1997.

S. Brin, R. Motwani, J. D. Ullman, and S. Tsur, « Dynamic Itemset Counting and Implication Rules for Market Basket Data, Proc. ACM SIGMOD Int'l Conf. on Management of Data, pp.255-264, 1997.

. Gan, B. Ganter, and R. Wille, Formal Concept Analysis: Mathematical Foundations, 1999.

G. Gardarin, P. Pucheral, and F. Wu, « Bitmap based algorithms for mining association rules, Actes des 14 es journées « Bases de données avancées, pp.157-175, 1998.

J. Guigues and V. Duquenne, « Famille minimale d'implication informatives résultant d'un tableau de données binaires, Math. Sci. Hum, vol.24, pp.95-100, 1986.

H. Han, J. L. Plank, and A. W. , Background for association rules and cost estimate of selected mining algorithms, Proceedings of the fifth international conference on Information and knowledge management , CIKM '96, pp.73-80, 1996.
DOI : 10.1145/238355.238440

H. Han, J. Pei, J. Yin, and Y. , « Mining frequent patterns without candidate generation, Proc. ACM SIGMOD Int'l Conf. on Management of Data, pp.1-12, 2000.

. Kam, M. Kamber, J. Han, and Y. Chiang, « Metarule-guided mining of multi-dimensional association rules using data cubes, Proc. of the 3rd KDD Int'l Conf, 1997.

B. Lent, A. Swami, and J. Widom, Clustering association rules, Proceedings 13th International Conference on Data Engineering, pp.220-231, 1997.
DOI : 10.1109/ICDE.1997.581756

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

H. Mannila, H. Toivonen, and A. I. Verkamo, « Efficient Algorithms for Discovering Association Rules, Proc. AAAI Workshop on Knowledge Discovery in Databases (KDD), pp.181-192, 1994.

M. Mannila, H. Toivonen, H. Verkamo, and A. I. , « Discovery of frequent episodes in event sequences, Data Mining and Knowledge Discovery, vol.1, issue.3, pp.259-289, 1997.
DOI : 10.1023/A:1009748302351

N. Novelli, R. Cicchetti, and «. Fun, FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies, Proc. of the 8th Int'l ICDT Conf, pp.189-203, 2001.
DOI : 10.1007/3-540-44503-X_13

J. S. Park, M. S. Chen, and P. S. Yu, « An Efficient Hash Based Algorithm for Mining Association Rules, Proc. ACM SIGMOD Int'l Conf. on Management of Data, pp.175-186, 1995.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, « Closed Set Based Discovery of Small Covers for Association Rules, Actes des 15 es journées « Bases de données avancées, pp.361-381, 1999.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering Frequent Closed Itemsets for Association Rules, Proc. of the 7th Int'l Conf. on Database Theory (ICDT), n o 1540 Lectures Notes in Computer Sciences, pp.398-416, 1999.
DOI : 10.1007/3-540-49257-7_25
URL : https://hal.archives-ouvertes.fr/hal-00467747

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, « Data Mining : algorithmes d'extraction et de réduction des règles d'association dans les bases de données », thèse d'université, 2000.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, « Closed set based discovery of small covers for association rules, Networking and Information Systems Journal, vol.3, issue.2, pp.344-377, 2000.

J. Pei, J. Han, and R. Mao, An efficient algorithm for mining frequent closed itemsets, Proc. Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD), pp.21-30, 2000.

S. Sarawagi, S. Thomas, and R. Agrawal, « Integrating association rule mining with databases: alternatives and implications, Proc. Int'l Conf. on Management of Data, 1998.
DOI : 10.1145/276305.276335

A. Savasere, E. Omiecinski, and S. Navathe, « An Efficient Algorithm for Mining Association Rules in Large Databases, Proc. of the 21th Int'l Conf. on Very Large Data Bases (VLDB), septembre 1995, pp.432-444

C. Silverstein, S. Brin, and R. Motwani, Beyond Market Baskets: Generalizing Association Rules to Dependence Rules, Data Mining and Knowledge Discovery, vol.2, issue.1, 1998.

R. Taouil, N. Pasquier, Y. Bastide, and L. Lakhal, « Mining basis for association rules using closed sets, Proc. of the 16th Int'l Conf. on Data Engineering (ICDE), n o 1861 Lecture Notes in Computer Science, p.307, 2000.

M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, « New Algorithms for Fast Discovery of Association Rules, Proc. of the 3rd Int'l Conf. on Knowledge Discovery in Databases (KDD), pp.283-286, 1997.