Formalization of a synthesis problem and methods for its solution

被引：0
作者：
A. A. Dokukin
机构：
[1] Russian Academy of Sciences,Dorodnicyn Computing Center
来源：
Computational Mathematics and Mathematical Physics | 2014年 / 54卷
关键词：
algebraic pattern recognition theory; logical regularities; synthesis problem;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A formal formulation is proposed for the synthesis problem of finding objects with certain properties described only by a collection of precedents. A key feature of this formalization is that it is closely related to the pattern recognition theory. A general approach to solving the synthesis problem is described, and particular solution methods are presented in two important cases. For this purpose, a new recognition method is proposed that exhibits a high speed as applied to the data of the structure under study. The performance of the methods is demonstrated on actual data.
引用
收藏
页码：1037 / 1045
页数：8
相关论文
共 3 条
  • [1] Nekrasov A N(2004)Analysis of the information structure of protein sequences: A new method for analyzing the domain organization of proteins J. Biomol. Struct. Dyn. 21 615-623
  • [2] Ryazanov V V(2007)Logical regularities in pattern recognition (parametric approach) Comput. Math. Math. Phys. 47 1720-1735
  • [3] Fisher R A(1922)On the Interpretation of X2 from contingency tables, and the calculation of P J. R. Stat. Soc. 85 87-94
1