About Azimkhon Ostonov Azimkhon Ostonov Postdoctoral Research Fellow, Computer Science decision trees machine learning Deep Reinforcement Learning Deep learning Events Presented Events May 4 - May 10, 2025 On Complexity of Decision Trees for Decision Tables from Closed Classes Azimkhon Ostonov, Postdoctoral Research Fellow, Computer Science May 4, 09:00 - 11:00 B5 L5 R5220 decision trees machine learning 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.
On Complexity of Decision Trees for Decision Tables from Closed Classes Azimkhon Ostonov, Postdoctoral Research Fellow, Computer Science May 4, 09:00 - 11:00 B5 L5 R5220 decision trees machine learning 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.
Engage ORCID ShareClipboard Related Sites Extensions of Dynamic Programming, Machine Learning, Discrete Optimization (TREES) Computer Science (CS) Related Content Articles 2 Events 1 Related Links Extensions of Dynamic Programming, Machine Learning, Discrete Optimization (TREES)
