可扩展的提升树系统。其中可扩展体现在哪里?
对稀疏数据的稀疏感知算法和weighted quantile sketch for approximate tree learning分别是什么含义呢?
更重要的是缓存访问模式、数据压缩与分片。(out-of-core tree learning)
a novel tree learning algorithm is for handling sparse data; a theoretically justified weighted quantile sketch procedure enables handling instance weights in approximate tree learning.