The Close-by-One (CbO) algorithm is a well-known algorithm used in Formal Concept Analysis (FCA). We shed a new light on CbO: First, we propose and evaluate a novel algorithm for computation of the Duquenne-Guigues basis which combines CbO and LinClosure algorithms. This combination enables us to reuse attribute counters used in LinClosure and speed up the computation. Second, we describe LCM, an algorithm for enumeration of frequent closed itemsets in transaction databases, in terms of FCA and show that LCM is basically the CbO algorithm with multiple speed-up features for processing sparse data. Third, we show that FCA and Logical Analysis of Data (LAD) utilize the same basic building blocks, which enable us to develop an interface between the two methodologies. We provide some preliminary benefits of the interface; most notably efficient algorithms for computing spanned patterns in LAD using algorithms of FCA.The Close-by-One (CbO) algorithm is a well-known algorithm used in Formal Concept Analysis (FCA). We shed a new light on CbO: First, we propose and evaluate a novel algorithm for computation of the Duquenne-Guigues basis which combines CbO and LinClosure algorithms. This combination enables us to reuse attribute counters used in LinClosure and speed up the computation. Second, we describe LCM, an algorithm for enumeration of frequent closed itemsets in transaction databases, in terms of FCA and show that LCM is basically the CbO algorithm with multiple speed-up features for processing sparse data. Third, we show that FCA and Logical Analysis of Data (LAD) utilize the same basic building blocks, which enable us to develop an interface between the two methodologies. We provide some preliminary benefits of the interface; most notably efficient algorithms for computing spanned patterns in LAD using algorithms of FCA.