Prikl. Diskr. Mat. Suppl., 2019, Issue 12, Pages 227–232
Computational methods in discrete mathematics
Algorithm for “safety” decomposition of the formal context
Ch. M. Mongushab
a Siberian Federal University, Krasnoyarsk
b Tyva State University
The $#$P-complete problem of finding all formal concepts of a given formal context is investigated. An algorithm which we propose, allows in practice to solve this problem in a polynomial time. This algorithm is based on the method of “safety” decomposition of the formal context into parts called boxes. With “safety” decomposition of a formal context into boxes, no formal concept of the original context is lost and no new formal concepts arise. The decomposition process is aimed at consistently reducing the size of the boxes of the formal context and is implemented iteratively. The rules for stopping the process of decomposition of the formal context into boxes, which guarantee the polynomial time of the entire decomposition process, are established: setting the threshold value for the density of boxes and the number of iterations of the decomposition.
formal context, formal concept, decomposition of formal context, algorithm of decomposition.
PDF file (576 kB)
Ch. M. Mongush, “Algorithm for “safety” decomposition of the formal context”, Prikl. Diskr. Mat. Suppl., 2019, no. 12, 227–232
Citation in format AMSBIB
\paper Algorithm for ``safety'' decomposition of the formal context
\jour Prikl. Diskr. Mat. Suppl.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|