Due to recent updates, all users are required to create an Altair One account to login to the RapidMiner community. Click the Register button to create your account using the same email that you have previously used to login to the RapidMiner community. This will ensure that any previously created content will be synced to your Altair One account. Once you login, you will be asked to provide a username that identifies you to other Community users. Email us at Community with questions.

Logic behind importance ranking in Gradient Boosted Tree (GBT)

PireheloPirehelo Member Posts: 12 Contributor II
edited November 2018 in Help

Hi,

Could you please explain what is the basis for ranking the importance of attributes in the GBT? For example, is it based on information gain or does it use a backward propagation/forward elimination approach such as the one in SelectAttribute operator does? I would appreciate your answers. I would appreciate even more if you could provide me with an article or a webpage (hopefully from rapidminer documentation) that explains the mathematical logic for ranking the attribute importance in Gradient Boosted Trees (GBT)

 

Thanks,

Best Answer

  • MartinLiebigMartinLiebig Administrator, Moderator, Employee, RapidMiner Certified Analyst, RapidMiner Certified Expert, University Professor Posts: 3,528 RM Data Scientist
    Solution Accepted

    Hi,

     

    this sounds like deep dive :). Have a look at my favourite ML book, Hastie et. al: https://web.stanford.edu/~hastie/ElemStatLearn/printings/ESLII_print12.pdf

     

    Page 367.

     

    It seems to be just the average of all feature importances of the individual trees.

     

    Best,

    Martin

    - Sr. Director Data Solutions, Altair RapidMiner -
    Dortmund, Germany

Answers

  • PireheloPirehelo Member Posts: 12 Contributor II

    Thanks Martin, I just checked the reference. You made my life easier. Thanks,

Sign In or Register to comment.