I am reading about decision tree , I saw a paper about CART algorithm , so , I saw they have the same steps to construct the tree , then, it is wright there is no different between them ? or they have ?
Good question google the question or see Gareth James et al introduction to Statistical Learning.in z-library. D. Booth Jerry Freedman at Stanford university invented all of this D. Booth
CART is an algorithm or procedure that a decision tree uses to decide how/where to split a node into two or more sub-nodes. Some other algorithms that decision trees may use are ID3, C4.5, CHAID, MARS. Different algorithms use different metrics for measuring the best decision. For example, CART uses the Gini Impurity while ID3 and C4.5 use Information gain.
See these links:
https://www.linkedin.com/pulse/digital-analytics-decision-trees-chaid-vs-cart-raymond-rashid
https://www.quora.com/What-are-the-differences-between-ID3-C4-5-and-CART
https://stackoverflow.com/questions/20092632/can-someone-explain-me-the-difference-between-id3-and-cart-algorithm
https://machinelearningmastery.com/classification-and-regression-trees-for-machine-learning/
https://medium.com/@abedinia.aydin/survey-of-the-decision-trees-algorithms-cart-c4-5-id3-97df842831cd
- Badges
- Science topic
- Similar topics
- Methodology
- Research Methodology
- Research Papers