LCM from FCA point of view: A CbO-style algorithm with speed-up features

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 bas...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of approximate reasoning Vol. 142; pp. 64 - 80
Main Authors Janostik, Radek, Konecny, Jan, Krajča, Petr
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.03.2022
Subjects
Algorithm
Close-by-One
Formal concept analysis
Frequent closed itemset
Formal concept analysis
Frequent closed itemset
Algorithm
Close-by-One
Online AccessGet full text
ISSN0888-613X
1873-4731
DOI10.1016/j.ijar.2021.11.005

Cover

More Information
Summary: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.
ISSN:0888-613X
1873-4731
DOI:10.1016/j.ijar.2021.11.005