1. Agrawal, R., Imielinski, T., Swami, A.: Mining associations between sets of items in massive databases. In: Proc. of the ACM-SIGMOD 1993 Int. Conf. on Management of Data, May 1993, pp. 207–216. ACM Press, New York (1993)
2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pp. 487–499 (1994)
3. Brin, S., et al.: Dynamic itemset counting and implication rules for market basket data. In: Peckham, J. (ed.) Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 255–264. ACM Press, New York (1997)
4. Bordat, J.: Calcul pratique du treillis de Galois d’une correspondance. Mathématiques, Informatiques et Sciences Humaines 24(94), 31–47 (1986)
5. Cellier, P., et al.: An algorithm to find frequent concepts of a formal context with taxonomy. In: Concept Lattices and Their Applications (2006)