Hands-On Data Structures and Algorithms with JavaScript

ID3 algorithm

So far, the algorithms that we have seen were not very complex; they were rather trivial, and most of our focus was on implementing the API for a particular data structure. In this example, there is no data structure to implement; the algorithm itself generates the decision tree that we would be using for our application.

First, let's take a look at how a table of historical data can be converted into a decision tree. The tree that is formed primarily is made up of decision nodes (which indicate a decision) and leaf nodes (which indicates the final response, such as yes or no).  The decision nodes can have two or more subnodes, depending on the dataset. However, the tree has to start from somewhere, right? What would be the ...