Computer Science, asked by asubhasree2000, 10 months ago

Which of the following is true for a decision tree?
A) Decision tree is an example of linear classifier.
B) The entropy of a node typically decreases as we go down a decision tree.
C) Entropy is a measure of purity.
D) An attribute with lower mutual information should be preferred to other attributes.

Answers

Answered by arnoygayen
5

Answer:

B) The entropy of a node typically decreases as we go down a decision tree. is correct

Answered by brokendreams
0

(B) The entropy of a node typically decreases as we go down a decision tree is true about a decision tree.

Definition of a decision tree;

Decision tree- referred as a tree diagram responsible for making decisions while doing business or computer programming.

Characteristics of a decision tree;

  • The branches represents the choices along with costs, results and responsibilities.
  • The decision tree is shown by roots and leaf nodes, where the nodes decreases as going down. The process is repeated for the sub tree rooted for classifying a decisions or a responsibilities.
  • The variables such as continuous and categorical are handled by the decision tree. It  provides the clear classification of the variables.
  • The decisions as well as the rules are generated. They are more understandable without requiring much computation.

Hence, decision tree is used in business or computer programming for operating rules and responsibilities.

Similar questions