The Apriori algorithm is a classical algorithm in data mining used for mining frequent itemsets and generating association rules from transactional datasets. It works on the principle that any subset of a frequent itemset must also be frequent. This property, known as the Apriori property, helps in pruning the search space significantly. In an AI and Machine Learning Lab, implementing Apriori in Python helps students understand unsupervised learning concepts, pattern discovery, support counting, and candidate generation. Below is a Python program that implements the Apriori algorithm on a sample transactional dataset of a small grocery store. The dataset consists of transactions where each transaction contains a list of items purchased together. The program identifies frequent itemsets based on a minimum support threshold and then generates association rules based on a minimum confidence threshold. ```python # Apriori Algorithm Implementation in Python from itertools import combinations # Sample transactional dataset (Grocery Store) dataset = [ ['Milk', 'Bread', 'Butter'], ['Beer', 'Bread'], ['Milk', 'Bread', 'Butter', 'Beer'], ['Bread', 'Butter'], ['Milk', 'Butter'], ['Beer', 'Bread'], ['Milk', 'Bread', 'Beer', 'Butter'] ] def get_support(itemset, transactions): count = 0 for transaction in transactions: if set(itemset).issubset(set(transaction)): count += 1 return count / len(transactions) def generate_candidates(prev_frequent, k): candidates = [] prev_frequent_list = list(prev_frequent) for i in range(len(prev_frequent_list)): for j in range(i + 1, len(prev_frequent_list)): union_set = prev_frequent_list[i].union(prev_frequent_list[j]) if len(union_set) == k: candidates.append(union_set) return list(set(candidates)) def apriori(transactions, min_support): items = set() for transaction in transactions: for item in transaction: items.add(frozenset([item])) frequent_itemsets = {} current_frequent = set() # Generate 1-itemsets for item in items: support = get_support(item, transactions) if support >=