R. Agrawal and R. Srikant, Fast algorithms for mining association rules, Proc. 20th int. conf. very large data bases, VLDB, pp.487-499, 1994.

A. Buzmakov, E. Egho, N. Jay, S. O. Kuznetsov, A. Napoli et al., On Projections of Sequential Pattern Structures (with an application on care trajectories), Proc. 10th Int. Conf. Concept Lattices Their Appl, pp.199-208, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00910300

A. Buzmakov, S. O. Kuznetsov, and A. Napoli, Scalable Estimates of Concept Stability, Form. Concept Anal, pp.161-176, 2014.
DOI : 10.1007/978-3-319-07248-7_12
URL : https://hal.archives-ouvertes.fr/hal-01095920

J. Cao, Z. Wu, and J. Wu, Scaling up cosine interesting pattern discovery: A depth-first method, Information Sciences, vol.266, issue.0, pp.31-46, 2014.
DOI : 10.1016/j.ins.2013.12.062

B. Ganter and S. O. Kuznetsov, Pattern Structures and Their Projections, Concept. Struct. Broadening Base, pp.129-142, 2001.
DOI : 10.1007/3-540-44583-8_10

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

J. Han, J. Wang, Y. Lu, and P. Tzvetkov, Mining top-k frequent closed patterns without minimum support, Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE Int. Conf, pp.211-218, 2002.

M. Kaytoue, S. O. Kuznetsov, and A. Napoli, Revisiting Numerical Pattern Mining with Formal Concept Analysis, IJCAI 2011 Proc. 22nd Int. Jt. Conf. Artif. Intell, pp.1342-1347, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00584371

S. O. Kuznetsov, On stability of a formal concept, Annals of Mathematics and Artificial Intelligence, vol.8, issue.3, pp.101-115, 2007.
DOI : 10.1007/s10472-007-9053-6

O. Sergei, M. V. Kuznetsov, and . Samokhin, Learning Closed Sets of Labeled Graphs for Chemical Applications, Inductive Log. Program. SE -12, pp.190-208, 2005.

H. Mannila, H. Toivonen, and . Verkamo, Efficient Algorithms for Discovering Association Rules, In Knowl. Discov. Data Min, pp.181-192, 1994.

F. Moerchen, M. Thies, and A. Ultsch, Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression, Knowledge and Information Systems, vol.9, issue.3, pp.55-80, 2011.
DOI : 10.1007/s10115-010-0329-5

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

C. Roth, S. A. Obiedkov, and D. G. Kourie, ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS, International Journal of Foundations of Computer Science, vol.19, issue.02, pp.383-404, 2008.
DOI : 10.1142/S0129054108005735

E. Spyropoulou, M. Tijl-de-bie, and . Boley, Interesting pattern mining in multi-relational data, Data Mining and Knowledge Discovery, vol.60, issue.1, pp.1-42, 2013.
DOI : 10.1007/s10618-013-0319-9

N. Tatti, F. Moerchen, and T. Calders, Finding Robust Itemsets under Subsampling, ACM Transactions on Database Systems, vol.39, issue.3, pp.1-27, 2014.
DOI : 10.1145/2656261

J. Vreeken and N. Tatti, Interesting Patterns, Freq. Pattern Min, pp.105-134, 2014.
DOI : 10.1007/978-3-319-07821-2_5

G. I. Webb, Self-sufficient itemsets, ACM Transactions on Knowledge Discovery from Data, vol.4, issue.1, pp.1-20, 2010.
DOI : 10.1145/1644873.1644876

G. I. Webb, Filtered-top-k association discovery, Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol.25, issue.3, pp.183-192, 2011.
DOI : 10.1002/widm.28

D. Xin, H. Cheng, X. Yan, and J. Han, Extracting redundancy-aware top-k patterns, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '06, p.444, 2006.
DOI : 10.1145/1150402.1150452
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.472.1876

X. Yan, H. Cheng, J. Han, and P. S. Yu, Mining significant graph patterns by leap search, Proceedings of the 2008 ACM SIGMOD international conference on Management of data , SIGMOD '08, pp.433-444, 2008.
DOI : 10.1145/1376616.1376662
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.4437

X. Yan, J. Han, and R. Afshar, CloSpan: Mining: Closed Sequential Patterns in Large Datasets, Proc. SIAM Int'l Conf. Data Min, pp.166-177, 2003.
DOI : 10.1137/1.9781611972733.15

H. Yao, J. Howard, and . Hamilton, Mining itemset utilities from transaction databases, Data & Knowledge Engineering, vol.59, issue.3, pp.603-626, 2006.
DOI : 10.1016/j.datak.2005.10.004