×







We sell 100% Genuine & New Books only!

Tree-Based Methods for Statistical Learning in R 1st Edition 2022 Hardbound at Meripustak

Tree-Based Methods for Statistical Learning in R 1st Edition 2022 Hardbound by Greenwell, Brandon M., Taylor and Francis Ltd

Books from same Author: Greenwell, Brandon M.

Books from same Publisher: Taylor and Francis Ltd

Related Category: Author List / Publisher List


  • Price: ₹ 8256.00/- [ 13.00% off ]

    Seller Price: ₹ 7183.00

Estimated Delivery Time : 4-5 Business Days

Sold By: Meripustak      Click for Bulk Order

Free Shipping (for orders above ₹ 499) *T&C apply.

In Stock

We deliver across all postal codes in India

Orders Outside India


Add To Cart


Outside India Order Estimated Delivery Time
7-10 Business Days


  • We Deliver Across 100+ Countries

  • MeriPustak’s Books are 100% New & Original
  • General Information  
    Author(s)Greenwell, Brandon M.
    PublisherTaylor and Francis Ltd
    Edition1st Edition
    ISBN9780367532468
    Pages388
    BindingHardbound
    LanguageEnglish
    Publish YearJune 2022

    Description

    Taylor and Francis Ltd Tree-Based Methods for Statistical Learning in R 1st Edition 2022 Hardbound by Greenwell, Brandon M.

    Thorough coverage, from the ground up, of tree-based methods (e.g., CART, conditional inference trees, bagging, boosting, and random forests).A companion website containing additional supplementary material and the code to reproduce every example and figure in the book.A companion R package, called treemisc, which contains several data sets and functions used throughout the book (e.g., there's an implementation of gradient tree boosting with LAD loss that shows how to perform the line search step by updating the terminal node estimates of a fitted rpart tree).Interesting examples that are of practical use; for example, how to construct partial dependence plots from a fitted model in Spark MLlib (using only Spark operations), or post-processing tree ensembles via the LASSO to reduce the number of trees while maintaining, or even improving performance. 1 Introduction 2 Binary recursive partitioning with CART 3 Conditional inference trees 4 "The hitchhiker's GUIDE to modern decision trees" 5 Ensemble algorithms 6 Peeking inside the "black box": post-hoc interpretability 7 Random forests 8 Gradient boosting machines



    Book Successfully Added To Your Cart