论文标题
LCM来自FCA的角度：具有加速功能的CBO风格算法
LCM from FCA Point of View: A CbO-style Algorithm with Speed-up Features
论文作者
论文摘要
LCM是用于列举事务数据库中频繁封闭项目集的算法。众所周知，当我们忽略所需频率时，封闭项目集正是正式概念分析（FCA）中形式概念的目的。我们用FCA来描述LCM，并表明LCM基本上是逐一的算法，具有多种加速功能，用于处理稀疏数据。我们分析了加速功能，并将其与类似FCA算法的功能进行了比较，例如FCBO和近距离家族的算法。
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.
