Post Your Answer
7 years ago in Research Methods By Isiaka Muhammad
How to represent algorithm using decision tree?
Hello all! I’m conducting research in machine learning area. When should I consider using decision tree? And how to represent algorithm using decision tree. Someone please explain with an example.
All Answers (3 Answers In All)
By Priyanshu Rathore Answered 7 years ago
When there is a fixed set of attributes, and these attributes take a small number of disjoint values.
When the target functions have discrete results.
When there are errors in the training data.
When the attribute values are in the training data.
Reply to Priyanshu Rathore
By Fathima M Answered 7 years ago
The text in italics represents internal/ decision node. Based on this the tree splits into branches. The branch that doesn’t split is the decision i.e whether the passenger survived not or not which is represented in bold text.
YES – Is the passenger a male or a female? – NO
↓
Is age > 10? Survived (24%)
↙  â†˜
Died (72%) is the child > 3?
↙  â†˜
0.31 Died(2%) survived(2%) 0.69
Reply to Fathima M
By Riya N Answered 7 years ago
Reply to Riya N
Related Questions