RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 2012 Volume 52, Number 4, Pages 746–749 (Mi zvmmf9691)

This article is cited in 4 papers

Algorithm for choosing conjunctions for logical recognition methods

N. N. Bondarenko, Yu. I. Zhuravlev

Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119333 Russia

Abstract: A new family of recognition algorithms for problems with binary information is constructed. A natural method is proposed for ordering conjunctions used in pattern recognition problems in the standard formulation and with binary features.

Key words: recognition methods, problem with binary information, algorithms, binary features.

UDC: 519.712

Received: 20.09.2011


 English version:
Computational Mathematics and Mathematical Physics, 2012, 52:4, 649–652

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024