Faster Algorithms for Constructing a Concept (Galois) Lattice - Clustering Challenges in Biological Network - page 179

Fig. 8.3. Step by step illustration of the 2-level BFS lattice construction algorithm. The context and
the corresponding lattice are shown in Fig. 8.2.
8.5.1. Algorithm 2: Computing All Concepts or Maximal Bipartite
Cliques
If one is interested in computing all the concepts and not in their lattice order, as
in enumerating all maximal bicliques studied in [20]. We can easily modify our
algorithm to give an even faster algorithm for this purpose. This is because in our
algorithm, each concept is generated many times, more precisely, at least number
of its predecessors times. For example in Fig. 8.3, ( d, 235) is generated twice, one
by each of its predecessor. However, when we need all concepts only, we do not