HomeworkLib
Question

Consider the following frequent 3-itemsets: {a, b, c}, {b, c, d}, {a, b, d}, {a, c,...

Consider the following frequent 3-itemsets: {a, b, c}, {b, c, d}, {a, b, d}, {a, c, d}, {a, d, e}, {a, c, e}
Use the Fk−1 x F1 method and the Fk−1 x Fk−1 method to answer each part.

a. List all the 4-itemsets that will be generated by Fk−1 x F1 candidate generation method and the 4-itemsets that will be selected after the pruning step of the Apriori algorithm.

b. List all the 4-itemsets that will be generated by Fk−1 x Fk−1 candidate generation method and the 4-itemsets that will be selected after the pruning step of the Apriori algorithm.

c. Consider a new candidate generation method in which a pair of frequent (k-1)-itemsets are merged only if the last (k-2) items of the first one are identical to the first (k-2) items of the second one. For example, {x,y,z} and {y,z,w} can be merged to generated {x,y,z,w}. List all the 4-itemsets that will be generated by this method and the 4-itemsets that will be selected after the pruning step of the Apriori algorithm.

d. How do the two sets of results (i.e., the candidates generated from candidate generation step and the itemsets after the pruning step) you obtained from part (b) related to the results you obtained from part (c).

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

0 0
Add a comment
Know the answer?
Add Answer to:
Consider the following frequent 3-itemsets: {a, b, c}, {b, c, d}, {a, b, d}, {a, c,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Consider the transactional database shown in the following table. Transaction ID Items Bought T100 Plum, Apple,...

    Consider the transactional database shown in the following table. Transaction ID Items Bought T100 Plum, Apple, Peach, Orange, Pear, Banana T200 Cherry, Apple, Peach, Orange, Pear, Banana T300 Plum, Mango, Orange, Pear, Kiwi, Strawberry T400 Plum, Watermelon, Avocado, Orange, Banana T500 Avocado, Apple, Orange, Lemon, Pear CONDITION: The minimum support is 60% and minimum confidence is 70%. Based on the CONDITION above, answer the following five questions. (1) Find all frequent itemsets using the Apriori algorithm. Show how the algorithm...

  • Language: SQL - Normalization and Functional Dependencies Part 4 Normalization and Functional Dependencies Consider the following relation R(A, B, C, D)and functional dependencies F that hold o...

    Language: SQL - Normalization and Functional Dependencies Part 4 Normalization and Functional Dependencies Consider the following relation R(A, B, C, D)and functional dependencies F that hold over this relation. F=D → C, A B,A-C Question 4.1 (3 Points) Determine all candidate keys of R Question 4.2 (4 Points) Compute the attribute cover of X-(C, B) according to F Question 43 (5 Points) Compute the canonical cover of F.Show each step of the generation according to the algorithm shown in class....

  • Table 1: Data set of market-basket transactions ansaction ID Items Bought [A, B, D, E (B, C, D (A...

    Table 1: Data set of market-basket transactions ansaction ID Items Bought [A, B, D, E (B, C, D (A, B, D, E) A, C, D, E) (B,C, D, E B, D, E (C, D) (A, B, C (A, D, E) 6 7 [15 points] Answer the following questions for the data set in Table 1. (a) What is the maximum number of association rules that can be extracted from this data set (including rules that have zero support)? (b) What...

  • This question is for frequent pattern mining algorithm Apriori and closed pattern mining algorithm like CLOSET....

    This question is for frequent pattern mining algorithm Apriori and closed pattern mining algorithm like CLOSET. Implement Apriori algorithm to mine frequent pattern from a transaction dataset Implement an algorithm to mine closed frequent pattern from the same dataset. You can either write a code to extract closed patterns from the result that you got in Part 1 or code CLOSET. Input Format The input dataset is a transaction dataset. The first line of the input corresponds to the minimum...

  • Consider the following reaction. 4 A + B + 2 C →→ 4 D + E...

    Consider the following reaction. 4 A + B + 2 C →→ 4 D + E The following data was collected on the reaction. Trial [A]0 [B]0 [C]0 Rate (M/s) 1 0.22 0.75 0.22 9.506 2 0.44 0.75 0.22 19.012 3 0.22 1.5 0.22 19.012 4 0.22 0.75 0.44 9.506 Two mechanisms are proposed: Mechanism 1: A + B →→ D + Y Y + C →→ X X + A + C →→ D + Z Z + A...

  • Consider the following reaction. 5 A + B + 4 C →→ 5 D + E...

    Consider the following reaction. 5 A + B + 4 C →→ 5 D + E The following data was collected on the reaction. Trial [A]0 [B]0 [C]0 Rate (M/s) 1 0.65 0.13 0.65 4.064 2 1.3 0.13 0.65 16.256 3 0.65 0.26 0.65 8.128 4 0.65 0.13 1.3 4.064 Two mechanisms are proposed: Mechanism 1: A + C →→ D + Y Y + C →→ X X +2 A + B →→ D + Z Z + A...

  • Consider the simple graph G, given the following: (assume A=0,B=1, C=2, D=3, E=4, F=5, G=6) A...

    Consider the simple graph G, given the following: (assume A=0,B=1, C=2, D=3, E=4, F=5, G=6) A 3 3 8 B D 5 ho 5 8 E F G 4 3 a) Use the Breadth-First Search algorithm to traverse G and give the traverse sequence, starting from A. Assume you always choose the candidate with the SMALLEST index among the candidates at each step. b) Use the Depth-First Search algorithm to traverse G and give the traverse sequence, starting from A....

  • Problem 3: Consider the wireless topology below. The solid circles represent the transmission rad...

    Problem 3: Consider the wireless topology below. The solid circles represent the transmission radius of nodes A and D, respectively, and the dashed circles represent the transmission range of B and C, respectively. In these problems, assume that losses only occur due to collisions. list the potential hidden terminals and exposed terminals when i) A is transmittng to B (ii) B is transmitting to A (iii) A is transmitting to C (iv) D is transmitting to HB Problem 4: Consider...

  • We are given four items, namely A, B, C, and D. Their corresponding unit profits are...

    We are given four items, namely A, B, C, and D. Their corresponding unit profits are pA, pB, pC, and pD. The following shows five transactions with these items. Each row corresponds to a transaction where a non-negative integer shown in the row corresponds to the total number of occurrences of the correspondence item present in the transaction. T A B C D t1 0 0 3 2 t2 3 4 0 0 t3 0 0 1 3 t4 1...

  • QUESTION 9 Let X={a,b,c,d), f={(a,b),(6.a),(c,c),(d,d)}cXxX, and g={(a,m),(6,4),(c,b),(d,c)}cXxX. Find fog. a((aa),(b,d),(c,b),(d.c)) b.((a.d),(6.b),(c,a),(d.c)) c. ((a.a),(6.b),(c,c),(d,d)) d.((a.c),(b,d).(c.a),(d.b) QUESTION 10...

    QUESTION 9 Let X={a,b,c,d), f={(a,b),(6.a),(c,c),(d,d)}cXxX, and g={(a,m),(6,4),(c,b),(d,c)}cXxX. Find fog. a((aa),(b,d),(c,b),(d.c)) b.((a.d),(6.b),(c,a),(d.c)) c. ((a.a),(6.b),(c,c),(d,d)) d.((a.c),(b,d).(c.a),(d.b) QUESTION 10 Let X={a,b,c,d), f={(a,b),(b,a),(c,c),(d,d)}c XXX, and g={(a,d),(b,a),(c,b),(d,c)}cXXX. Find gog. a. ((a.a),(6,d),(c,b),(d,c)} b.([a,d),(6.b),(ca),(d.c)} c.{(a,a),(6.b),(c,c),(d,d)} d.((a.c),(b,d),(c,a),(d,b) QUESTION 11 What is the dominant operation in this algorithm? 1. Input the number of values n 2. Input the list of numbers x1, x2, ..., X 3. min = x 4. For i = 2 to n do 4.1. If xi < min then 4.1.1. min < x; 5. Output...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT