Question

Decision Tree 0.0/20.0 points (graded) Which of these are true? Decision trees are built using a greedy algorithm Decision tree growth does not use a greedy algorithm Only strictly convex functions can be used to decide how to split at a node Only strictly concave functions can be used to decide how to split at a node Piecewise linear functions can be used to decide how to split at a node

          Decision Tree
0.0/20.0 points (graded)
Which of these are true?
Decision trees are built using a greedy algorithm
Decision tree growth does not use a greedy algorithm
Only strictly convex functions can be used to decide how to split at a node
Only strictly concave functions can be used to decide how to split at a node
Piecewise linear functions can be used to decide how to split at a node

Decision Tree
0.0/20.0 points (graded)
Which of these are true?
Decision trees are built using a greedy algorithm
Decision tree growth does not use a greedy algorithm
Only strictly convex functions can be used to decide how to split at a node
Only strictly concave functions can be used to decide how to split at a node
Piecewise linear functions can be used to decide how to split at a node

Added by Derek K.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Akash M

Step 1

Decision trees are built using a greedy algorithm. This statement is true. Decision trees are built using a greedy algorithm, where at each step, the algorithm chooses the best split based on a certain criterion, without considering the future consequences of the Show more…

Show all steps

Thanks for your feedback!

Which of these are true? Decision trees are built using a greedy algorithm. Decision tree growth does not use a greedy algorithm. Only strictly convex functions can be used to decide how to split at a node. Only strictly concave functions can be used to decide how to split at a node. Piecewise linear functions can be used to decide how to split at a node.