decision trees

Relations between Decision Trees and Decision Rule Systems

-

B5 L5 R5220

This thesis investigates the complex transformation of decision rule systems into decision trees, establishing bounds on tree depth, developing polynomial-time path-finding algorithms and an optimal dynamic programming algorithm for minimum depth, and analyzing time-space complexity trade-offs for trees over infinite binary information systems.

On Complexity of Decision Trees for Decision Tables from Closed Classes

-

B5 L5 R5220

This thesis considers classes of decision tables closed under operations of removal of attributes (columns) and changing of decisions and study for the tables from these classes relationships among the minimum complexity of deterministic and nondeterministic decision trees and the complexity of the set of attributes attached to columns of the table, while also analyzing the algorithms for constructing decision trees for these decision tables.

Decision Trees for Fault Diagnosis in Circuits and Switching Networks

-

B9 L2 H2325

We study theoretical problems of fault diagnosis in circuits and switching networks, which are among the most fundamental models for computing Boolean functions.

Kerven Durdymyradov

Ph.D. Student, Computer Science
Honors and Awards Bronze Medal and Honourable Mention- International Mathematical Olympiad (IMO). Netherlands–Kazakhstan (2011, 2010) 1st and 2nd place Winner - Open Doors International Olympiad - Mathematics & AI track. Russia (2022, 2020) Silver and Bronze Medals - Balkan Mathematical Olympiad (BMO). Romania-Moldova (2011, 2010) Silver and Bronze Medals - South Eastern Mathematical Olympiad (SEEMOUS). Romania-Greece (2014, 2013)