CS 361 Combinatorial Machine Learning

Course

Description

Lower and upper bounds on complexity and algorithms for construction (optimization) of decision trees, decision rules and tests. Decision tables with one-valued decisions and decision tables with many-valued decisions. Approximate decision trees, rules and tests. Global and local approaches to the study of problems over infinite sets of attributes. Applications to discrete optimization, fault diagnosis, pattern recognition, analysis of acyclic programs, data mining and knowledge discovery. Current results of research. The course covers tools for design and analysis of decision trees, decision rules and tests, their applications to supervised machine learning, and related topics including current results of research. The main contents are: introduction (basic notions and examples from applications); tools (relationships among decision trees, rules and tests, bounds on complexity of tests, decision rules and trees, algorithms for construction of tests, decision rules and trees); applications (supervised machine learning); some of the additional topics (decision tables with many-valued decisions, approximate decision trees, rules and tests, global and local approaches to the study of problems over infinite sets of attributes, applications to combinatorial optimization, fault diagnosis, pattern recognition, analysis of acyclic programs, data mining and knowledge representation); current results of research.
Course period02/5/11 → …
Course level300