Computational Experiments to Analyze the Effectiveness of the Algorithm for Decomposing a Formal Context into Fragments

The article presents the results of computational experiments. The following is evaluated: the effectiveness of the algorithm for fragmentation and defragmentation of the formal context with a single decomposition of the context; the number of fragments formed depending on the density of the original formal context; the number of possible iterations of the fragmentation process; the number of fragments and the running time of the algorithm for the context depending on the threshold value σ for the fragments being formed.