Systematic categorization and evaluation of CbO-based algorithms in FCA
| Autor: | Jan Konecny, Petr Krajča |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Information Systems and Management
Closed set Efficient algorithm Computer science Computation 05 social sciences 050301 education 02 engineering and technology Computer Science Applications Theoretical Computer Science Categorization Artificial Intelligence Control and Systems Engineering 0202 electrical engineering electronic engineering information engineering Enumeration Formal concept analysis 020201 artificial intelligence & image processing Polynomial delay 0503 education Algorithm Software |
| Zdroj: | Information Sciences. 575:265-288 |
| ISSN: | 0020-0255 |
| DOI: | 10.1016/j.ins.2021.06.024 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect