What is decision tree classification?
- 1 Answers
- 268 Views
- I also Faced
- E-Mail Answers
Answer / Afak Khan
Decision Tree Classification is a popular machine learning algorithm used for both categorical and continuous data. It constructs a tree-like model where each internal node represents a test on an attribute, each branch represents the outcome of the test, and each leaf node (terminal node) represents a class label.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is the meaning of overfitting in machine learning?
Why overfitting happens?
Explain the Algorithm Technique of Supervised Learning in Machine Learning?
What is data pre-processing technique for machine learning?
What is the Difference between Inductive Learning and Analytical Learning in Machine Learning?
What are PCA, KPCA, and ICA used for?
Why is naïve bayes machine learning algorithm naïve?
What is symbolic planning?
Tell us what's the difference between a generative and discriminative model?
What is your opinion on our current data process?
How is ML different from artificial intelligence?
What is Model Selection in Machine Learning?
-
AI Algorithms (74) - AI Natural Language Processing (96)
- AI Knowledge Representation Reasoning (12)
- AI Robotics (183)
- AI Computer Vision (13)
- AI Neural Networks (66)
- AI Fuzzy Logic (31)
- AI Games (8)
- AI Languages (141)
- AI Tools (11)
- AI Machine Learning (659)
- Data Science (671)
- Data Mining (120)
- AI Deep Learning (111)
- Generative AI (153)
- AI Frameworks Libraries (197)
- AI Ethics Safety (100)
- AI Applications (427)
- AI General (197)
- AI AllOther (6)
