comparing and analyzing the computational complexity of fca algorithms
We introduce results of efficiency comparative analysis of algorithms for building the sets of formal concepts. The main goals of research are ascertainment current state of algorithmization of basic tasks in Formal Concept Analysis (FCA), discovering most efficient implementations of algorithms, negotiation of common view on the future of computer aided FCA task solving. Using integrated research environment "Graph Model Workshop" we practically estimate the asymptotic computational complexity on different collections of formal contexts with increasing number of objects and attributes. One of the results is construction of database of comparative analysis. We plan to expand database and invite all concerned researchers to participate in this process.
computational complexity algorithm formal concept analysis implementation