While watching a car race at the local track, you notice tha…
While watching a car race at the local track, you notice that some drivers wear long sleeves while others wear short sleeves. Also, all of the drivers carry a beverage while they drive (coffee, tea, or water). Finally, some drivers carry extra fuel while others choose to carry a spare tire instead. Some of the drivers finish the race, and others have to stop early. For these 3 variables, there are roughly 256 possible decision trees that will classify the drivers as “finishing” or “not finishing”. Describe how you would use “greedy optimal split” to build a minimum-height decision tree. Identify and name all of the features in your search space. Specify how building your decision tree is similar to a search problem. How would you decide what variable to “split” at each tier?
Read Details