|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
Completeness criteria for models of algorithms and classes of decision rules in classification problems with set-theoretic restrictionsстатья
- Авторы: Rudakov K.V., Chekhovich Y.V.
- Журнал: Doklady Akademii nauk SSSR
- Том: 394
- Номер: 4
- Год издания: 2004
- Издательство: Akademiia Nauk Sssr
- Местоположение издательства: Russian Federation
- Первая страница: 459
- Последняя страница: 461
- Аннотация: In the framework of algebraic approach to synthesis of correct image recognition, classification and prediction algorithms investigated is a class of problems, characterized by presence of explicitly posed set-theoretic restrictions on the algorithm's permissible response set. Classification problem is described as the problem of information transforming algorithm synthesis. Considered is the problem of synthesis of algorithms realizing mappings from initial information space into final information space.
- Добавил в систему: Рудаков Константин Владимирович