Saved Bookmarks
| 1. |
If we convert a decision tree to a set of logical rules, then: A. the internal nodes in a branch are connected by AND and the branches by AND B. the internal nodes in a branch are connected by OR and the branches by OR C. the internal nodes in a branch are connected by AND and the branches by OR D. the internal nodes in a branch are connected by OR and the branches by AND |
|
Answer» If we convert a DECISION tree to a set of logical rules, then: C. the internal NODES in a branch are connected by AND and the BRANCHES by OR is correct.
|
|