Pushing the Envelope of Gradient Boosting Forests via Globally-Optimized Oblique Trees-Reference-Cited by-同舟云学术

Pushing the Envelope of Gradient Boosting Forests via Globally-Optimized Oblique Trees

Published:2022-06 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
language:
Short-container-title:

Author:

Gabidolla Magzhan¹,Carreira-Perpinan Miguel A.¹

Affiliation:

1. University of California,Dept. CSE,Merced

Funder

NSF

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9878378/9878366/09880404.pdf?arnumber=9880404

Reference41 articles.

1. Improved Boosted Regression Forests Through Non-Greedy Tree Optimization

2. Smaller, more accurate regression forests using tree altern ating optimization;zharmagambetov;Proc of the 37th Int Conf Machine Learning (ICML 2020),0

3. Boosting. Foundations and Algorithms;schapire;Adaptive Computation and Machine Learning Series,2012

4. Looking for lumps: boosting and bagging for density estimation

5. Global refinement of random forest;ren;Proc of the 2015 IEEE Computer Society Conf Computer Vision and Pattern Recognition (CVPR'15),2015

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Shapley Deep Learning: A Consensus for General-Purpose Vision Systems;2023 IEEE/CVF International Conference on Computer Vision Workshops (ICCVW);2023-10-02

2. Towards Better Decision Forests: Forest Alternating Optimization;2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR);2023-06

3. Improved Multiclass AdaBoost Using Sparse Oblique Decision Trees;2022 International Joint Conference on Neural Networks (IJCNN);2022-07-18

4. Sparse Oblique Decision Trees: A Tool to Interpret Natural Language Processing Datasets;2022 International Joint Conference on Neural Networks (IJCNN);2022-07-18