Scribd
Upload
597 views1 page

Assosiation Rule

The document discusses mining association rules from transactional databases. It provides two examples, each with transactions of items and specifications for minimum support and confidence. For the first example, it asks to find all frequent itemsets using FP-growth and for the second, to list the largest frequent itemset and all strong association rules containing that set at the category level, and just the largest frequent itemset at the brand-category level.

Uploaded by

Naglaa Mostafa
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
597 views1 page

Assosiation Rule

The document discusses mining association rules from transactional databases. It provides two examples, each with transactions of items and specifications for minimum support and confidence. For the first example, it asks to find all frequent itemsets using FP-growth and for the second, to list the largest frequent itemset and all strong association rules containing that set at the category level, and just the largest frequent itemset at the brand-category level.

Uploaded by

Naglaa Mostafa
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Ch5:- Association Rules 5.3 A database has five transactions.

Let min sup = 60% and min con f = 80%.

(a) Find all frequent itemsets using FP-growth.

5.5 A database has four transactions. Let min sup = 60% and min con f = 80%.

(a) At the granularity of item category (e.g., itemi could be Milk), for the following rule template,

list the frequent k-itemset for the largest k, and all of the strong association rules (with their support s and confidence c) containing the frequent k-itemset for the largest k. (b) At the granularity of brand-item category (e.g., itemi could be Sunset-Milk), for the following rule template

list the frequent k-itemset for the largest k (but do not print any rules).

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy