Use the results in parts (c) and (d) to conclude about the greedy nature of the decision tree induction algorithm.
The greedy heuristic does not necessarily lead to the best tree.The following table summarizes a data set with three attributes A, B, C and
two class labels +, ?. Build a two-level decision tree.
The greedy heuristic does not necessarily lead to the best tree.
Computer Science & Information Technology
You might also like to view...
What does the term World Wide Web refer to?
a. the Internet b. a worldwide collection of servers networked together c. all hyperlinked web pages on the Internet d. a selection of documents from zoos and universities related to web-spinning spiders
Computer Science & Information Technology
HTML files have an .html or .htm file extension for viewing in a web browser
Indicate whether the statement is true or false.
Computer Science & Information Technology