Threshold Based Splitting Rules MCQ

Test your knowledge with important Threshold Based Splitting Rules MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Threshold Based Splitting Rules MCQs at Bissoy

• If the original number of real valued features is d and the number of examples is m, then which of the following statements is not true?
  ক

  The number of constructed binary features becomes dm

  খ

  Calculating the Gain of each feature might take O(dm2) operations

  গ

  With more improved implementation the run time can be reduced to O(dmlog(m))

  ঘ

  The constructed binary features are dm
• Which of the following statements is not true about reducing a real valued feature problem into binary feature?
  ক

  It utilizes the threshold based splitting rules

  খ

  Once the binary features are constructed the ID3 algorithm can be easily applied

  গ

  After ID3 applied it is easy to verify that there exists a decision tree with different training error

  ঘ

  After ID3 applied it is easy to verify that there exists a decision tree with same number of nodes
• Real valued features problems in decision trees cannot be solved using ID3 algorithm.
  ক

  True

  খ

  False
• Splitting is the process of dividing a node into two or more sub-nodes.
  ক

  True

  খ

  False
• Which of the following statements is not true about Decision trees?
  ক

  It builds classification models in the form of a tree structure

  খ

  It builds regression models in the form of a tree structure

  গ

  The final result is a tree with decision nodes and leaf nodes

  ঘ

  It never breaks down a dataset into smaller subsets with increase in depth of tree