1. **Problem Statement:** We have customer orders and want to find association rules using the ECLAT algorithm with minimum support 33% (at least 2 transactions) and minimum confidence 60%. 2. **Data:** - S1: Qəhvə, Keks - S2: Çay, Sendviç - S3: Qəhvə, Sendviç - S4: Çay, Keks - S5: Qəhvə, Çay - S6: Qəhvə, Keks, Sendviç 3. **Step 1: Calculate support for each item:** - Total transactions = 6 - Support(Qəhvə) = 4/6 = 66.7% (S1, S3, S5, S6) - Support(Keks) = 3/6 = 50% (S1, S4, S6) - Support(Çay) = 3/6 = 50% (S2, S4, S5) - Support(Sendviç) = 3/6 = 50% (S2, S3, S6) All single items meet minimum support. 4. **Step 2: Calculate support for item pairs:** - (Qəhvə, Keks): Transactions S1, S6 → 2/6 = 33.3% - (Qəhvə, Çay): Transactions S5 → 1/6 = 16.7% - (Qəhvə, Sendviç): Transactions S3, S6 → 2/6 = 33.3% - (Keks, Çay): Transactions S4 → 1/6 = 16.7% - (Keks, Sendviç): Transactions S6 → 1/6 = 16.7% - (Çay, Sendviç): Transactions S2 → 1/6 = 16.7% Only (Qəhvə, Keks) and (Qəhvə, Sendviç) meet minimum support. 5. **Step 3: Calculate confidence for association rules from pairs:** - Rule 1: Qəhvə → Keks - Confidence = Support(Qəhvə, Keks) / Support(Qəhvə) = (2/6) / (4/6) = 0.5 = 50% < 60% (discard) - Rule 2: Keks → Qəhvə - Confidence = Support(Qəhvə, Keks) / Support(Keks) = (2/6) / (3/6) = 0.6667 = 66.7% ≥ 60% (keep) - Rule 3: Qəhvə → Sendviç - Confidence = (2/6) / (4/6) = 0.5 = 50% < 60% (discard) - Rule 4: Sendviç → Qəhvə - Confidence = (2/6) / (3/6) = 0.6667 = 66.7% ≥ 60% (keep) 6. **Step 4: Final association rules meeting support and confidence:** - Keks → Qəhvə with support 33.3% and confidence 66.7% - Sendviç → Qəhvə with support 33.3% and confidence 66.7% **Answer:** - Association rules: 1. Keks → Qəhvə 2. Sendviç → Qəhvə These rules mean customers who order Keks or Sendviç are likely to also order Qəhvə with confidence above 60%.