Comparison of Data Structures for Computing Formal Concepts [chapter]

Petr Krajca, Vilem Vychodil
2009 Lecture Notes in Computer Science  
Presented is preliminary study of the role of data structures in algorithms for formal concept analysis. Studied is performance of selected algorithms in dependence on chosen data structures and size and density of input object-attribute data. The observations made in the paper can be seen as guidelines on how to select data structures for implementing algorithms for formal concept analysis.
doi:10.1007/978-3-642-04820-3_11 fatcat:ma24uhkunrcztaqomdmplxnbv4