McqMate

Q. |
## The partition algorithm uses _______ scans of the databases to discover all frequent sets. |

A. | two. |

B. | four. |

C. | six. |

D. | eight. |

Answer» A. two. |

3.6k

0

Do you find this helpful?

52

View all MCQs in

Data Mining and Data WarehouseNo comments yet

- The basic partition algorithm reduces the number of database scans to ________ & divides it into partitions.
- The ________ algorithm is based on the observation that the frequent sets are normally very few in number compared to the set of all itemsets.
- The ________ algorithm is based on the observation that the frequent sets are normally very few in number compared to the set of all itemsets.
- The basic idea of the apriori algorithm is to generate________ item sets of a particular size & scans the database.
- The basic idea of the apriori algorithm is to generate________ item sets of a particular size & scans the database.
- If a set is a frequent set and no superset of this set is a frequent set, then it is called ________.
- Any subset of a frequent set is a frequent set. This is ___________.
- If an itemset is not a frequent set and no superset of this is a frequent set, then it is _______.
- The a priori frequent itemset discovery algorithm moves _______ in the lattice.
- An algorithm called________is used to generate the candidate item sets for each pass after the first.