Vasyl'ev S. Tasks complexity and effectiveness of recognition procedures

Українська версія

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0408U002487

Thesis Registration Form

0408U002487.pdf

Applicant for

Specialization

  • 01.05.01 - Теоретичні основи інформатики та кібернетики

23-05-2008

Specialized Academic Board

Д 26.194.02

V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine

Essay

Determined lower score for accuracy of class of recognition tasks in discrete case for independent criterions. Optimal recognition procudure that is based on separating hyperplane is built in boolean case. Effective method of protein secondary structure prediction based on Bayesian recognition procedure on Markov chains is built. Key words: Bayesian recognition procedure, procedure accuracy score, protein secondary structure, statistical analysis of DNA.

Read more

Files

aref.doc

disser.doc

Similar theses

0421U102388

Nasirov Emil Mekhdiievych

Parallelization of non-negative huge sparse linguistic matrix and tensors factorization

0420U102355

Dudar Vyacheslav Vyacheslavovych

Training algorithms and invariance to geometric transformations of neural networks

0520U101700

Prytomanova Olga M.

Fuzzy problems of optimal set partitioning: theoretical bases, methods and algorithms for solving

0520U100242

Zavadskyi Ihor O.

Splittable codes and their applications

0520U100209

Rystsov Ihor

Application of algebraic automata theory to analysis of discrete dynamical systems.