Geodesic
Algorithm for ``safety'' decomposition of the formal context
Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 227-232.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Mots-clés : formal context, formal concept, decomposition of formal context, algorithm of decomposition. 
@article{PDMA_2019_12_a61,
     author = {Ch. M. Mongush},
     title = {Algorithm for ``safety'' decomposition of the formal context},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {227--232},
     publisher = {mathdoc},
     number = {12},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2019_12_a61/}
}
TY  - JOUR
AU  - Ch. M. Mongush
TI  - Algorithm for ``safety'' decomposition of the formal context
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2019
SP  - 227
EP  - 232
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2019_12_a61/
LA  - ru
ID  - PDMA_2019_12_a61
ER  - 
%0 Journal Article
%A Ch. M. Mongush
%T Algorithm for ``safety'' decomposition of the formal context
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2019
%P 227-232
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2019_12_a61/
%G ru
%F PDMA_2019_12_a61
Ch. M. Mongush. Algorithm for ``safety'' decomposition of the formal context. Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 227-232. http://geodesic.mathdoc.fr/item/PDMA_2019_12_a61/

[1] Birkgof G., Teoriya reshetok, Nauka, M., 1984, 568 pp. | MR

[2] Ganter B., Wille R., Formal Concept Analyses: Mathematical Foundations, Springer Science and Business Media, 2012, 314 pp. | MR

[3] Ganter B., Obiedkov S. A., Conceptual Exploration, Springer, Berlin–Heidelberg, 2016, 315 pp. | MR | Zbl

[4] Kuznetsov S. O., Obiedkov S. A., “Comparing performance of algorithms for generating concept lattices”, J. Exper. Theor. Artificial Intelligence, 14:2 (2002), 189–216 | DOI | Zbl

[5] Mongush Ch. M., Bykova V. V., “On decomposition of a binary context without losing formal concepts”, J. Siberian Federal University. Mathematics and Physics, 2019, no. 3, 323–330 | DOI | MR

[6] Bykova V. V., Mongush Ch. M., “Dekompozitsionnyi podkhod k issledovaniyu formalnykh kontekstov”, Prikladnaya diskretnaya matematika, 2019, no. 44, 111–124

[7] Mongush Ch. M., Bykova V. V., Programma FCACorpus kontseptualnogo modelirovaniya tuvinskikh tekstov metodami analiza formalnykh ponyatii, Svid. o gos. registratsii programmy dlya EVM No 2018618907, vydano Federalnoi sluzhboi po intellektualnoi sobstvennosti RF, 2018