Answer / Prashant Shukla

Decision tree classification is a type of machine learning algorithm that makes decisions by constructing a tree 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. The tree is constructed to minimize impurity in the data.

What is Test set in machine learning?

1 Answers  

---

Why does overfitting happen?

1 Answers  

---

How will you explain a linked list and an array?

1 Answers  

---

What are the different categories you can categorized the sequence learning process?

1 Answers  

---

How do we separate one dimensional, two dimensional and three-dimensional data?

1 Answers  

---

Why naive bayes is called naive?

1 Answers  

---

Why is naive bayes better than decision tree?

1 Answers  

---

On what basis do you choose a classifier?

1 Answers  

---

Tell me what is the difference between bias and variance?

1 Answers  

---

What is an Incremental Learning algorithm in ensemble?

1 Answers  

---

Is regression a machine learning?

1 Answers  

---

What do you understand by Precision and Recall?

1 Answers  

---