Paper Info
Title
Systematic categorization and evaluation of CbO-based algorithms in FCA
Abstract
Algorithms based on Close-by-One (CbO) are polynomial delay algorithms used for the enumeration of closed sets, particularly formal concepts in Formal Concept Analysis. We describe and categorize their distinctive features. We experimentally evaluate the influence of the features on the computation time. We show that via the study of individual features, we can design new and more efficient algorithms.
Year
DOI
Venue
2021
10.1016/j.ins.2021.06.024
Information Sciences
Keywords
DocType
Volume
Formal concept analysis,Close-by-One,Algorithm,Performance,Comparison
Journal
575
ISSN
Citations 
PageRank 
0020-0255
1
0.35
References 
Authors
0
2
Name
Order
Citations
PageRank
Jan Konecny111517.20
Petr Krajca2809.47