LCM is an algorithm for enumeration of frequent closed itemsets in transaction databases. It is well known that when we ignore the required frequency, the closed itemsets are exactly intents of formal concepts in Formal Concept Analysis (FCA). We describe LCM in terms of FCA and show that LCM is basically the Close-by-One algorithm with multiple speed-up features for processing sparse data. We analyze the speed-up features and compare them with those of similar FCA algorithms, like FCbO and algorithms from the In-Close family.

翻译：LCM是计算交易数据库中经常封闭的物品的算法,众所周知,当我们忽略所要求的频率时,封闭的物品恰恰是正式概念分析中正式概念概念的用意。我们用FCA来描述LCM,并表明LCM基本上是一个接一个的算法,具有处理稀有数据的多重加速功能。我们分析加速功能,并将其与类似的FCA算法(如FCbO和In-Close家族的算法)进行比较。