Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | DocType |
|---|---|---|
2020 | CLA | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Radek Janostik | 1 | 1 | 0.72 |
| Jan Konecny | 2 | 115 | 17.20 |
| Petr Krajca | 3 | 80 | 9.47 |