Comparing and analyzing the computational complexity of FCA algorithms

Authors:
Fedor Strok;Alexey Neznanov
Affiliations:
State University, Moscow, Russian Federation;State University, Moscow, Russian Federation
Venue:
SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
Year:
2010

Citing 2
Cited 1

Formal Concept Analysis: Foundations and Applications (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)

Formal Concept Analysis: Foundations and Applications (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)
Two FCA-Based Methods for Mining Gene Expression Data

ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis

Formal concept discovery in semantic web data

ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.