Machine Learning Decision Trees

Machine Learning Decision Trees Quiz

15 Questions Published

Questions

Question 1 Multiple Choice (Single Answer)

What is a decision tree in machine learning?

  1. A supervised learning model that uses a tree-like structure to make decisions.
  2. An unsupervised learning model that uses a tree-like structure to find patterns in data.
  3. A reinforcement learning model that uses a tree-like structure to learn from its environment.
  4. A neural network model that uses a tree-like structure to process data.
Question 2 Multiple Choice (Single Answer)

What is the main advantage of decision trees?

  1. They are easy to interpret.
  2. They can handle both categorical and numerical data.
  3. They are robust to outliers.
  4. All of the above.
Question 3 Multiple Choice (Single Answer)

What is the main disadvantage of decision trees?

  1. They can be biased towards the majority class.
  2. They can be sensitive to noise in the data.
  3. They can overfit the data.
  4. All of the above.
Question 4 Multiple Choice (Single Answer)

What is the most common algorithm used to build decision trees?

  1. ID3
  2. C4.5
  3. CART
  4. All of the above.
Question 5 Multiple Choice (Single Answer)

What is the difference between ID3 and C4.5?

  1. ID3 uses information gain to split the data, while C4.5 uses gain ratio.
  2. ID3 can handle only categorical data, while C4.5 can handle both categorical and numerical data.
  3. ID3 is more sensitive to noise in the data than C4.5.
  4. All of the above.
Question 6 Multiple Choice (Single Answer)

What is the difference between CART and ID3/C4.5?

  1. CART uses the Gini impurity to split the data, while ID3/C4.5 use information gain or gain ratio.
  2. CART can handle both categorical and numerical data, while ID3/C4.5 can handle only categorical data.
  3. CART is less sensitive to noise in the data than ID3/C4.5.
  4. All of the above.
Question 7 Multiple Choice (Single Answer)

What is pruning in decision trees?

  1. Removing unnecessary branches from a decision tree to improve its performance.
  2. Adding new branches to a decision tree to improve its performance.
  3. Changing the decision criteria at each node of a decision tree to improve its performance.
  4. None of the above.
Question 8 Multiple Choice (Single Answer)

What is the most common pruning method used in decision trees?

  1. Cost-complexity pruning
  2. Reduced error pruning
  3. Minimum description length pruning
  4. All of the above.
Question 9 Multiple Choice (Single Answer)

What is the main advantage of pruning decision trees?

  1. It reduces the size of the tree.
  2. It improves the accuracy of the tree.
  3. It makes the tree easier to interpret.
  4. All of the above.
Question 10 Multiple Choice (Single Answer)

What is the main disadvantage of pruning decision trees?

  1. It can lead to underfitting.
  2. It can make the tree more sensitive to noise in the data.
  3. It can increase the computational cost of building the tree.
  4. All of the above.
Question 11 Multiple Choice (Single Answer)

When should you use a decision tree?

  1. When you have a large dataset.
  2. When you have a dataset with both categorical and numerical features.
  3. When you need a model that is easy to interpret.
  4. All of the above.
Question 12 Multiple Choice (Single Answer)

When should you not use a decision tree?

  1. When you have a small dataset.
  2. When you have a dataset with a lot of noise.
  3. When you need a model with high accuracy.
  4. All of the above.
Question 13 Multiple Choice (Single Answer)

What are some applications of decision trees?

  1. Fraud detection
  2. Customer churn prediction
  3. Medical diagnosis
  4. All of the above.
Question 14 Multiple Choice (Single Answer)

What are some of the most popular decision tree libraries in Python?

  1. scikit-learn
  2. XGBoost
  3. LightGBM
  4. All of the above.
Question 15 Multiple Choice (Single Answer)

What are some of the most popular decision tree libraries in R?

  1. rpart
  2. party
  3. randomForest
  4. All of the above.