Home / Engineering / Data Mining and Business Intelligence MCQs / Page 16

Data Mining and Business Intelligence MCQs | Page - 16

Dear candidates you will find MCQ questions of Data Mining and Business Intelligence here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 51.17K Points
Coach

Q. 151) All set of items whose support is greater than the user-specified minimum support are called as_____________

(A) Border set
(B) Frequent set
(C) Maximal frequent set
(D) Lattice
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 152) If a set is a frequent set and no superset of this set is a frequent set, then it is called____________

(A) Maximal frequent set
(B) Border set
(C) Lattice
(D) Infrequent sets
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 153) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 154) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 155) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 156) A priori algorithm is otherwise called as_________

(A) Width-wise algorithm
(B) Level-wise algorithm
(C) Pincer-search algorithm
(D) FP growth algorithm
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 157) The A Priori algorithm is a____________

(A) Top-down search
(B) Breadth first search
(C) Depth first search
(D) Bottom-up search
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 158) The first phase of A Priori algorithm is___________

(A) Candidate generation
(B) Itemset generation
(C) Pruning
(D) Partitioning
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 159) The second phase of A Priori algorithm is____________

(A) Candidate generation
(B) Itemset generation
(C) Pruning
(D) Partitioning
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 160) The step eliminates the extensions of (k-1)-itemsets which are not found to be frequent, from being considered for counting support.

(A) Candidate generation
(B) Pruning
(C) Partitioning
(D) Itemset eliminations
View Answer Discuss Share