edu.cn同济大学,电子与信息工程学院,智信馆410室.pptVIP

Expressiveness Decision trees can express any function of the input attributes. E.g., for Boolean functions, truth table row → path to leaf: Trivially, there is a consistent decision tree for any training set with one path to leaf for each example (unless f nondeterministic in x) but it probably wont generalize to new examples Prefer to find more compact decision trees 上海市精品课程 人工智能原理 18 Hypothesis spaces How many distinct decision trees with n Boolean attributes? = number of Boolean functions = number of distinct truth tables with 2n rows = 22n E.g., with 6 Boolean attributes, there a