R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), pp.487-499, 1994.

H. Li, Y. Wang, D. Zhang, M. Zhang, and E. Y. Chang, Pfp, Proceedings of the 2008 ACM conference on Recommender systems, RecSys '08, pp.107-114, 2008.
DOI : 10.1145/1454008.1454027

S. Goel, A. Broder, E. Gabrilovich, and B. Pang, Anatomy of the long tail, Proceedings of the third ACM international conference on Web search and data mining, WSDM '10, pp.201-210, 2010.
DOI : 10.1145/1718487.1718513

T. Uno, M. Kiyomi, and H. Arimura, Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets, Proceedings of the Workshop on Frequent Itemset Mining Implementations (FIMI), 2004.
DOI : 10.1145/1133905.1133916

J. Han, J. Wang, Y. Lu, and P. Tzvetkov, Mining top-k frequent closed patterns without minimum support, Proceedings of the International Conference on Data Mining (ICDM), pp.211-218, 2002.

N. Pasquier, Y. Bastide, R. Taouil, and L. , Discovering Frequent Closed Itemsets for Association Rules, Proceedings of the 7th International Conference on Database Theory (ICDT), pp.398-416, 1999.
DOI : 10.1007/3-540-49257-7_25
URL : https://hal.archives-ouvertes.fr/hal-00467747

T. Uno, T. Asai, Y. Uchida, and H. Arimura, An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases, Discovery Science, pp.16-31, 2004.
DOI : 10.1007/978-3-540-30214-8_2

R. Fagin, A. Lotem, and M. Naor, Optimal aggregation algorithms for middleware, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '01, pp.102-113, 2001.
DOI : 10.1145/375551.375567
URL : http://arxiv.org/abs/cs/0204046

J. Dean and S. Ghemawat, MapReduce, Proceedings of the 6th Symposium on Operating System Design and Implementation (OSDI), 2004.
DOI : 10.1145/1327452.1327492

B. Négrevergne, A. Termier, J. Méhaut, and T. Uno, Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses, 2010 International Conference on High Performance Computing & Simulation, pp.521-528, 2010.
DOI : 10.1109/HPCS.2010.5547082

M. Kirchgessner, V. Leroy, S. Amer-yahia, and S. Mishra, Intermarché Alimentaire International Stime, Testing interestingness measures in practice: A large-scale analysis of buying patterns, Proceedings of the International Conference on Data Science and Advanced Analytics (DSAA), p.2016

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

S. Minato, T. Uno, K. Tsuda, A. Terada, and J. Sese, A Fast Method of Statistical Assessment for Combinatorial Hypotheses Based on Frequent Itemset Enumeration, Machine Learning and Knowledge Discovery in Databases, vol.8725, pp.422-436, 2014.
DOI : 10.1007/978-3-662-44851-9_27

J. Pei, J. Han, and R. Mao, Closet: An efficient algorithm for mining frequent closed itemsets, ACM SIGMOD workshop on research issues in data mining and knowledge discovery, pp.21-30, 2000.

J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, ACM SIGMOD Record, vol.29, issue.2, pp.1-12, 2000.
DOI : 10.1145/335191.335372
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.2678

A. Ghoting, G. Buehrer, S. Parthasarathy, D. Kim, A. Nguyen et al., Cache-conscious frequent pattern mining on modern and emerging processors, The VLDB Journal, vol.16, issue.1, pp.77-96, 2007.
DOI : 10.1007/s00778-006-0025-y

M. Lin, P. Lee, and S. Hsueh, Apriori-based frequent itemset mining algorithms on MapReduce, Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication, ICUIMC '12, pp.2012-76
DOI : 10.1145/2184751.2184842

S. Moens, E. Aksehirli, and B. Goethals, Frequent Itemset Mining for Big Data, 2013 IEEE International Conference on Big Data, 2013.
DOI : 10.1109/BigData.2013.6691742

M. Riondato, J. A. Debrabant, R. Fonseca, and E. , PARMA, Proceedings of the 21st ACM international conference on Information and knowledge management, CIKM '12, pp.85-94
DOI : 10.1145/2396761.2396776

W. Hamalainen and M. Nykanen, Efficient discovery of statistically significant association rules, in: Data Mining, pp.203-212, 2008.

G. Liu, M. Feng, Y. Wang, L. Wong, S. Ng et al., Towards exploratory hypothesis testing and analysis, 2011 IEEE 27th International Conference on Data Engineering, pp.745-756, 2011.
DOI : 10.1109/ICDE.2011.5767907
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.3325

Y. , L. Bras, P. Lenca, and S. Lallich, Mining interesting rules without support requirement: a general universal existential upward closure property of Annals of information systems, pp.75-98, 2010.

C. Anderson, The Long Tail: Why the Future of Business Is Selling Less of More, 2006.