Skip to content

RobustnessVerificationTreeModelsCliqueMethod & Decision Trees #1365

Answered by beat-buesser
melikedem asked this question in Q&A
Discussion options

You must be logged in to vote

Hi @melikedem I think it's because the algorithm implemented by RobustnessVerificationTreeModelsCliqueMethod is designed for ensembles of trees, for example where it forms cliques. A single tree can be verified exactly and much more efficiently in linear time with a different algorithm (Algorithm 3). Would you be interested to implemented the Algorithm 3 for a single decision tree?

Replies: 1 comment 2 replies

Comment options

You must be logged in to vote
2 replies
@melikedem
Comment options

@beat-buesser
Comment options

Answer selected by melikedem
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
2 participants