Ganter, B., Wille, R.: Formal Concept Analysis – Mathematical Foundations. Springer, Heidelberg (1999)
 Ferré, S.: A proposal for extending Formal Concept Analysis to knowledge graphs. In: Int. Conf. Formal Concept Analysis (ICFCA). LNAI 9113, pp. 271-286. Springer (2015)
 Ferré, S., Cellier P.: Graph-FCA in Practice - Int. Conf. Conceptual Structures (ICCS). LNAI 9717, Springer (2016)
 Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraphs in the presence of isomorphism. Int. Conf. Data Mining. IEEE (2003)
 Yan, X. and Han, J.: CloseGraph: mining closed frequent graph patterns. Int. Conf. Knowledge discovery and data mining (SIGKDD). ACM (2003)
 Dolques, X. and Huchard, M. and Nebut, C. and Reitz, P.: Learning transformation rules from transformation examples: An approach based on relational concept analysis. Enterprise Distributed Object Computing Conf. Work. (EDOCW). IEEE (2010)
 M. Klimushkin, S. Obiedkov, and C. Roth: Approaches to the selection of relevant concepts in the case of noisy data. International Conference on Formal Concept Analysis. Springer Berlin Heidelberg, 2010.
 J. Vreeken, M. Van Leeuwen, A. Siebes: Krimp: mining itemsets that compress - Data Mining and Knowledge. Springer, 2011.
 D.J. Cook, and L.B. Holder. Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research 1 (1994): 231-255.