Сибирский федеральный университет

Тип публикации: статья из журнала

Год издания: 2019

Идентификатор DOI: 10.17516/1997-1397-2019-12-3-323-330

Ключевые слова: formal concept analysis, decomposition of the binary context

Аннотация: 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.

Журнал: JOURNAL OF SIBERIAN FEDERAL UNIVERSITY-MATHEMATICS & PHYSICS

Выпуск журнала: Vol. 12, Is. 3

Номера страниц: 323-330

ISSN журнала: 19971397

Место издания: KRASNOYARSK

Издатель: SIBERIAN FEDERAL UNIV

• Mongush Choduraa M. (Siberian Fed Univ, Inst Math & Comp Sci, Svobodny 79, Krasnoyarsk 660041, Russia; Tuvan State Univ, Lenina 36, Kyzyl 667000, Tuva, Russia)
• Bykova Valentina V. (Siberian Fed Univ, Inst Math & Comp Sci, Svobodny 79, Krasnoyarsk 660041, Russia)

• Web of Science Core Collection
• Scopus
• Ядро РИНЦ (eLIBRARY.RU)
• Список ВАК