M

Mr. Dubey • 54.69K Points
Coach 

Q. If {A,B,C,D} is a frequent itemset, candidate rules which is not possible is

  • (A) c → a
  • (B) d → abcd
  • (C) a → bc
  • (D) b → adc

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs on Machine Learning

Q. You've just finished training a decision tree for spam classification, and it is getting abnormally bad performance on both your training and test sets. You know that your implementation has no bugs, so what could be causing the problem?

Q. A machine learning problem involves four attributes plus a class. The attributes have 3, 2, 2, and 2 possible values each. The class has 3 possible values. How many maximum possible different examples are there?

Q. The ‘$’ present in the RegExp object is called a

Q. The node directly above a node is called

Q. Which of the following can be used to select HTML elements based on the value of their name attributes?

Q. Which of the following property allows you to specify an element’s position with respect to the browser window?

Q. The adjusted multiple coefficient of determination accounts for

Q. To determine association rules from frequent item sets

Q. Which of the following is the Web application equivalent to querySelectorAll()?

Q. What are two steps of tree pruning work?

Learn All Machine Learning MCQs

Question analytics