27: Decision Trees (1 of 2)

The Crystal Ball - Instruction Manual I: Introduction to Data Science · LibreTexts

0%

Contents

    Text

    Size
    100%
    Theme
    Typeface
    Line length
    Spacing

    From LibreTexts, under not declared, as the source states it; its equations are written in TeX, which the PDF shows typeset. This page at LibreTexts.

    27: Decision Trees (1 of 2)

    So far our classification picture has been very general. We haven’t said anything about how our classifier might actually work; we’ve just said that given values for each of the features, it will render a prediction about what the label will be.

    In chapters 27 and 28, we’ll study one particular algorithm for classification in machine learning: the decision tree algorithm. Not only does it make a good introductory technique because of its intuitive appeal, and not only can it classify pretty well in its own right, but it also serves as the basis for a more sophisticated, stateof-the-art classification method called “random forest” which we’ll explore in Volume Two of this series.


    This page titled 27: Decision Trees (1 of 2) was last modified on Sun, 18 Sep 2022 02:06:06 GMT and is shared under a not declared license and was authored, remixed, and/or curated by Stephen Davies (allthemath.org) via source content that was edited to the style and standards of the LibreTexts platform.