"Abstract Tree boosting is a highly effective and widely used machine learning method. In this paper, we describe a scalable end-to-end tree boosting system called XGBoost, which is used widely by data scientists to achieve state-of-the-art results on many machine learning challenges. We propose a novel sparsity-aware algorithm for sparse data and weighted quantile sketch for approximate tree learning. More importantly, we provide insights on cache access patterns, data compression and sharding to build a scalable tree boosting system. By combining these insights, XGBoost scales beyond billions of examples using far fewer resources than existing systems."

Authors: Tianqi ChenCarlos Guestrin

Read full article at http://arxiv.org/abs/1603.02754

Views: 2095

Tags: data, decision, learning, machine, science, trees


You need to be a member of Data Science Central to add comments!

Join Data Science Central

Comment by Cameron Turner on March 17, 2016 at 9:04am

Cran R package inbound? :) 

© 2021   TechTarget, Inc.   Powered by

Badges  |  Report an Issue  |  Privacy Policy  |  Terms of Service