- Issue
- Journal of Siberian Federal University. Mathematics & Physics. 2019 12 (3)
- Authors
- Mongush, Choduraa M.; Bykova, Valentina V.
- Contact information
- Mongush, Choduraa M.: Institute of Mathematics and Computer Science Siberian Federal University Svobodny, 79, Krasnoyarsk, 660041 Tuvan State University Lenina, 36, Kyzyl, Tuva, 667000 Russia; ; Bykova, Valentina V.: Institute of Mathematics and Computer Science Siberian Federal University Svobodny, 79, Krasnoyarsk, 660041 Russia;
- Keywords
- formal concept analysis; decomposition of the binary context
- Abstract
The #P-complete problem of finding all the formal concepts of a given context and the decomposition method for its solving are investigated. As parts of the decomposition is proposed to use fragments of the initial context, called boxes. Such decomposition allows to decompose the given context without losing formal concepts and thereby to reduce the execution time of the algorithms for solving considered task. The number of boxes, obtained at each iteration of the decomposition, is determined based on studies of the boxes structure and the rules for stopping of the decomposition process are established
- Pages
- 323–330
- DOI
- 10.17516/1997-1397-2019-12-3-323-330
- Paper at repository of SibFU
- https://elib.sfu-kras.ru/handle/2311/110244
Journal of Siberian Federal University. Mathematics & Physics / On Decomposition of a Binary Context Without Losing Formal Concepts
Full text (.pdf)