Decision trees
Decision tree algorithms are used for making decisions based on certain conditions. A decision tree is drawn upside down with its root at the top.
Let's take an organization's data where the feature set consists of certain software products along with their attributes—the time taken to build the product T, the effort taken to build the product E, and the cost taken to build the product C. It needs to be decided whether those products are to be built in the company or should be bought as products directly from outside the company.
Now, let's see how the decision tree could be created for this. In the following diagram, the bold text in black represents a condition/internal node, based on which the tree splits into branches/ ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access