Scribd Logo
Upload

Welcome to Scribd!

  • Vanilla Algorithm With Bagging With Boosting

    Uploaded by

    arabella
    6 views5 pages
    The document compares the performance of a decision tree algorithm (J48) and a k-nearest neighbors algorithm (IBk) with and without bagging and boosting. It finds that bagging and boosting improve the accuracy of the decision tree, but bagging slightly decreases the accuracy of k-nearest neighbors, since it is already a stable classifier.

    Original Description:

    hw

    Original Title

    homework

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document compares the performance of a decision tree algorithm (J48) and a k-nearest neighbors algorithm (IBk) with and without bagging and boosting. It finds that bagging and boosting improve the accuracy of the decision tree, but bagging slightly decreases the accuracy of k-nearest neighbors, since it is already a stable classifier.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views5 pages

    Vanilla Algorithm With Bagging With Boosting

    Uploaded by

    arabella
    The document compares the performance of a decision tree algorithm (J48) and a k-nearest neighbors algorithm (IBk) with and without bagging and boosting. It finds that bagging and boosting improve the accuracy of the decision tree, but bagging slightly decreases the accuracy of k-nearest neighbors, since it is already a stable classifier.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 5

    Homework 3: Individual Problem

    Algorithm selected: J48 (pruned decision tree)

    Error rates (correctly classified instances):


    Vanilla algorithm With Bagging With boosting
    87.5549 % 92.6794 % 92.2401 %

    Bagging and boosting both help in improving the performance of the original algorithm.
    Algorithm selected: IBk (k-nearest neighbours)

    Error rates (correctly classified instances):


    Vanilla algorithm With Bagging With boosting
    91.2152 % 90.776 % 91.0688 %
    I chose another algorithm (kNN), for which bagging performs slightly poor than the original
    algorithm.

    Bagging usually helps where the classifier is unstable (here decision tree) and may hurt the
    performance of a stable classifier (here k-nearest neighbors). By averaging over bootstrapped
    datasets it tries to reduce the variance but has little effect on bias.

    You might also like