Top 250+ Solved Data Mining and Business Intelligence MCQ Questions Answer
Q. The first phase of A Priori algorithm is___________
a. Candidate generation
b. Itemset generation
c. Pruning
d. Partitioning
Q. The second phase of A Priori algorithm is____________
a. Candidate generation
b. Itemset generation
c. Pruning
d. Partitioning
Q. 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
Q. The a priori frequent itemset discovery algorithm moves in the lattice
a. Upward
b. Downward
c. Breadthwise
d. Both upward and downward
Q. After the pruning of a priori algorithm,__________will remain
a. Only candidate set
b. No candidate set
c. Only border set
d. No border set
Q. The number of iterations in a priori
a. Increases with the size of the maximum frequent set
b. Decreases with increase in size of the maximum frequent set
c. Increases with the size of the data
d. Decreases with the increase in size of the data
Q. MFCS is the acronym of____________
a. Maximum Frequency Control Set
b. Minimal Frequency Control Set
c. Maximal Frequent Candidate Set
d. Minimal Frequent Candidate Set
Q. Dynamic Itemset Counting Algorithm was proposed by
a. Bin et al
b. Argawal et at
c. Toda et al
d. Simon et at
Q. Itemsets in the category of structures have a counter and the stop number with them
a. Dashed
b. Circle
c. Box
d. Solid
Q. The itemsets in the_________category structures are not subjected to any counting
a. Dashes
b. Box
c. Soli
d. D Circle
Q. Certain itemsets in the dashed circle whose support count reach support valueduring an iteration move into the______________
a. Dashed box
b. Solid circle
c. Solid box
d. None of the above
Q. Certain itemsets enter afresh into the system and get into the , which are essentially the supersets of the itemsets that move from the dashed circle to the dashed box
a. Dashed box
b. Solid circle
c. Solid box
d. Dashed circle
Q. The item sets that have completed on full pass move from dashed circle to________
a. Dashed box
b. Solid circle
c. Solid box
d. None of the above
Q. A frequent pattern tree is a tree structure consisting of ________
a. An item-prefix-tree
b. A frequent-item-header table
c. A frequent-item-node
d. Both A & B