4.20.4. Class Assignment Rule

Once a node is declared to be a leaf, then it has to be given a class label. A commonly used rule is the majority rule, that is, the leaf is labeled as ωj whereIn words, we assign a leaf, t, to that class to which the majority of the vectors in Xt belong.

Having discussed the major elements needed for the growth of a decision tree, we are now ready to summarize the basic algorithmic steps for constructing a binary decision tree

  • Begin with the root node, that is, Xt = X
  • For each new node t
    • For every feature xk, k = 1, 2,…, l
      • For every value αkn, n = 1, 2,…, Ntk
        • Generate XtY and XtN according to the answer in the ...

Get Pattern Recognition, 4th Edition now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.