Questions

Homework 5

Answer the following questions: (10 point each)

Don't use plagiarized sources. Get Your Custom Essay on
Questions
Just from $13/Page
Order Essay

1- Consider the data set shown in Table 5.1.

Table 5.1. Example of market basket transactions.

Customer ID

Transaction ID

Items Bought

1

0001

{a, d, e}

2

0024

{a, b, c, e}

2

0012

{a, b, d, e}

2

0031

{a, c, d, e}

3

0015

{b, c, e}

3

0022

{b, d, e}

3

0029

{c, d}

4

0040

{a, b, c}

5

0033

{a, d, e}

(a) Compute the support for item sets {e}, {b, d}, and {b, d, e} by treating each transaction ID as a market basket.

S({c}) =

S({e, d}) =

S({a, b, d}) =

S({c, d}) =

(b) Use the results in part (a) to compute the confidence for the association

rules {b, d} {e} and {e} {b, d}. Is confidence a symmetric measure?

c(bd e) =

c(e bd) =

2. Consider the market basket transactions shown in Table 5.2.

Table 5.2. Market basket transactions

Transaction ID

Items Bought

1

{Milk, Beer, Diapers}

2

{Bread, Butter, Milk}

3

{Milk, Diapers, Cookies}

4

{Bread, Butter, Cookies}

5

{Beer, Cookies, Diapers}

6

{Milk, Diapers, Bread, Butter, Cheese}

7

{Bread, Butter, Diapers}

8

{Beer, Diapers}

9

{Milk, Diapers, Bread, Butter}

10

{Beer, Cookies}

(a) What is the maximum number of association rules that can be extracted from this data (including rules that have zero support)?

Answer:

(b) What is the maximum size of frequent item sets that can be extracted (assuming minusup > 0)?

Answer:

(c) Write an expression for the maximum number of size-3 itemsets that can be derived from this data set.

Answer:

(d) Find an itemset (of size 2 or larger) that has the largest support.

Answer:

(e) Find a pair of items, a and b, such that the rules {a} → {b} and {b} → {a} have the same confidence.

Answer:

3. The Apriori algorithm uses a generate-and-count strategy for deriving frequent itemsets. Candidate itemsets of size k+1 are created by joining a pair of frequent itemsets of size k (this is known as the candidate generation step). A candidate is discarded if any one of its subsets is found to be infrequent during the candidate pruning step. Suppose the Apriori algorithm is applied to the data set shown in Table 5.3 with minsup = 30%, i.e., any itemset occurring in less than 3 transactions is considered to be infrequent.

Table 5.3. Example of market basket transactions.

Transaction ID

Items Bought

1

{a, b, c}

2

{b, c, d}

3

{a, b, d}

4

{a, c, d}

5

{b, c}

6

{c, d}

7

{c}

8

{a, b, c}

9

{a, d}

10

{b, d}

(a) Draw an itemset lattice representing the data set given in Table 5.3.

Label each node in the lattice with the following letter(s):

• N: If the itemset is not considered to be a candidate itemset by the Apriori algorithm. There are two reasons for an itemset not to be considered as a candidate itemset: (1) it is not generated at all during the candidate generation step, or (2) it is generated during the candidate generation step but is subsequently removed during the candidate pruning step because one of its subsets is found to be infrequent.

• F: If the candidate itemset is found to be frequent by the Apriori algorithm.

• I: If the candidate itemset is found to be infrequent after support counting.

Answer:

(b) What is the percentage of frequent itemsets (with respect to all itemsets in the lattice)?

Answer:

(c) What is the pruning ratio of the Apriori algorithm on this data set? (Pruning ratio is defined as the percentage of itemsets not considered to be a candidate because (1) they are not generated during candidate generation or (2) they are pruned during the candidate pruning step.)

Answer:

(d) What is the false alarm rate (i.e, percentage of candidate itemsets that are found to be infrequent after performing support counting)?

Answer:

1

Place your order
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more
Live Chat+1(978) 822-0999EmailWhatsApp