Top 250+ Solved Data Mining and Business Intelligence MCQ Questions Answer
Q. The proportion of transaction supporting X in T is called_____________.
a. Confidence
b. Support
c. Support count
d. All of the above
Q. The absolute number of transactions supporting X in T is called _______.
a. Confidence
b. Support
c. Support count
d. None of the above
Q. The value that says that transactions in D that support X also support Y is called__________.
a. Confidence
b. Support
c. Support count
d. None of the above
Q. The left hand side of an association rule is called________.
a. Consequent
b. Onset
c. Antecedent
d. Precedent
Q. The right hand side of an association rule is called__________.
a. Consequent
b. Onset
c. Antecedent
d. Precedent
Q. Which of the following is not a desirable feature of any efficient algorithm?
a. To reduce number of input operation
b. To reduce number of output operations
c. To be efficient in computing
d. To have maximal code length
Q. All set of items whose support is greater than the user-specified minimum support are calledas_____________
a. Border set
b. Frequent set
c. Maximal frequent set
d. Lattice
Q. If a set is a frequent set and no superset of this set is a frequent set, then it iscalled____________
a. Maximal frequent set
b. Border set
c. Lattice
d. Infrequent sets
Q. Any subset of a frequent set is a frequent set. This is_________
a. Upward closure property
b. Downward closure property
c. Maximal frequent set
d. Border set
Q. Any superset of an infrequent set is an infrequent set. This is ___________
a. Maximal frequent set
b. Border set
c. Upward closure property
d. Downward closure property
Q. If an itemset is not a frequent set and no superset of this is a frequent set, then it is
a. Maximal frequent set
b. Border set
c. Upward closure property
d. Downward closure property
Q. A priori algorithm is otherwise called as_________
a. Width-wise algorithm
b. Level-wise algorithm
c. Pincer-search algorithm
d. FP growth algorithm
Q. The A Priori algorithm is a____________
a. Top-down search
b. Breadth first search
c. Depth first search
d. Bottom-up search