Constructing A Decision Tree Using Information Gain
A decision tree can be constructed top-down using the information gain in the following way:
- begin at the root node
- determine the attribute with the highest information gain which is not already used as an ancestor node
- add a child node for each possible value of that attribute
- attach all examples to the child node where the attribute values of the examples are identical to the attribute value attached to the node
- if all examples attached to the child node can be classified uniquely add that classification to that node and mark it as leaf node
- go back to step two if there are unused attributes left, otherwise add the classification of most of the examples attached to the child node
Read more about this topic: Information Gain In Decision Trees
Famous quotes containing the words constructing, decision, tree, information and/or gain:
“The very hope of experimental philosophy, its expectation of constructing the sciences into a true philosophy of nature, is based on induction, or, if you please, the a priori presumption, that physical causation is universal; that the constitution of nature is written in its actual manifestations, and needs only to be deciphered by experimental and inductive research; that it is not a latent invisible writing, to be brought out by the magic of mental anticipation or metaphysical mediation.”
—Chauncey Wright (1830–1875)
“Moral choices do not depend on personal preference and private decision but on right reason and, I would add, divine order.”
—Basil Hume (b. 1923)
“Cynicism is the humour of hatred.”
—Herbert Beerbohm, Sir Tree (1853–1917)
“But while ignorance can make you insensitive, familiarity can also numb. Entering the second half-century of an information age, our cumulative knowledge has changed the level of what appalls, what stuns, what shocks.”
—Anna Quindlen (b. 1952)
“The west yet glimmers with some streaks of day.
Now spurs the lated traveller apace
To gain the timely inn.”
—William Shakespeare (1564–1616)