1. Fast algorithms for mining association rules;Agrawal,1994
2. A ‘best-of-breed’ approach for designing a fast algorithm for computing fixpoints of galois connections;Andrews;Inf. Sci.,2015
3. William W. Armstrong. Dependency structures of data base relationships. In IFIP Congress, 1974.
4. Konstantin Bazhanov and Sergei A. Obiedkov. Comparing performance of algorithms for generating the duquenne-guigues basis. In Amedeo Napoli and Vilém Vychodil, editors, Proceedings of The Eighth International Conference on Concept Lattices and Their Applications, Nancy, France, October 17–20, 2011, volume 959 of CEUR Workshop Proceedings, pages 43–57. CEUR-WS.org, 2011.
5. Calcul pratique du treillis de Galois d’une correspondance;Bordat;Math. Sci. Hum.,1986