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
Decision Tree vs ID3
tanthiamhuat
Member Posts: 4 
Contributor I
could anyone explain to me what is the difference when using either Decision Tree or ID3 in RapidMiner?
I try both Decision Tree and ID3 on a same DataSet_A, they produce different outputs.
Again, I try Decision Tree and ID3 on a same DataSet_B, they produce same outputs.
So what are the criteria that determines whether same or different outputs? what how do we know which to use?
I use Information Gain for both.
I try both Decision Tree and ID3 on a same DataSet_A, they produce different outputs.
Again, I try Decision Tree and ID3 on a same DataSet_B, they produce same outputs.
So what are the criteria that determines whether same or different outputs? what how do we know which to use?
I use Information Gain for both.
Tagged:
0
Answers
if i remember it correctly the standard Rapidminer Decision Tree implements both ID3 and CHAID, depending on which criterion you use.
The big benefit of using RM Decision Tree (v6.3+) is, that the decision tree is running in parallel. The Weka models don't. So i woud prefer the RM one first place.
~Martin
Dortmund, Germany