The Altair Community is migrating to a new platform to provide a better experience for you. In preparation for the migration, the Altair Community is on read-only mode from October 28 - November 6, 2024. Technical support via cases will continue to work as is. For any urgent requests from Students/Faculty members, please submit the form linked here

optimizing Decision tree

ThiruThiru Member Posts: 100 Guru
edited February 2020 in Help
I would like to go through the step by step result of ID3 decision tree
algorithm.  would like to see what would be the value of information gain
if we choose particular feature at specific level. What would happen if
we artifically change the most informative feature to some other at root node.  
can we play around Id3 algorithm or if web resources to try that for a sample data set. thanks. 
Tagged:

Best Answer

Answers

  • Telcontar120Telcontar120 RapidMiner Certified Analyst, RapidMiner Certified Expert, Member Posts: 1,635 Unicorn
    RapidMiner is not set up very well to do this kind of step-by-step evaluation of a decision tree because there are no manual controls for variable selection and split values at each tree branch.  You can do this somewhat manually for the root node by using the Decision Stump operator, but that will only let you evaluate and compare different candidates for the root node.  The only other way to do this easily is to compare different trees after selective removing attributes so that only certain subsets of attributes are available for each tree version.

    Brian T.
    Lindon Ventures 
    Data Science Consulting from Certified RapidMiner Experts
Sign In or Register to comment.