Quiz-1(G3)

Let L3 = {{A, B, C}, {A, B, D}, {A, C, D}, {B, C, D}}. How many candidate 4-itemsets (C4) will be generated using the F3 × F3 method before pruning?

Which of the following best describes the computational cost associated with Fk-1 × Fk-1 candidate generation as k increases?

• It decreases linearly

• It increases exponentially due to subset checks

• It remains constant for large k

• It becomes negligible due to pruning

In the context of candidate generation using Fk-1 × Fk-1, pruning is performed to:

• Ensure the candidate is lexicographically sorted

• Eliminate candidates containing any infrequent (k–1)-subset

• Improve algorithm efficiency by reducing support count operations

• Guarantee that only maximal itemsets are retained

In rule generation from frequent itemsets in the Apriori algorithm:

• All non-empty subsets of a frequent itemset are considered for rule generation

• Confidence is calculated as support(X ∪ Y) / support(X)

• The lift of a rule is always greater than 1 for strong rules

• Rules are retained only if they meet both minimum support and minimum confidence thresholds

When using the Apriori algorithm, generating rules from a frequent itemset of size k can result in up to __________ rules.

How many times is the original transaction database scanned in FP-Growth algorithm?

The path from any node to the root in an FP-tree represents a __________ of a transaction.

A __________ is a subset of a data warehouse that is focused on a particular subject or department.

The process of extracting data from source systems and loading it into the data warehouse is called __________.

ETL stands for: