a) Given the set of transactions in the table, compute the support for itemsets {e}, {b, d), and (b, d, e} by treating each transaction ID as a market basket. Transaction ID 0001 0024 0012 0031 0015 0022 0029 0040 0033 0038 Items Bought {a,d,e} {a,b,c, e} {a, b, d, e} {a, c, d, e} {b, c, e} {b, d, e} {c,d} {a,b,c} {a, d, e} {a,b,e}

a) Given the set of transactions in the table, compute the support for itemsets {e}, {b, d), and (b, d, e} by treating each transaction ID as a market basket. Transaction ID 0001 0024 0012 0031 0015 0022 0029 0040 0033 0038 Items Bought {a,d,e} {a,b,c, e} {a, b, d, e} {a, c, d, e} {b, c, e} {b, d, e} {c,d} {a,b,c} {a, d, e} {a,b,e}

A Guide to SQL

9th Edition

ISBN:9781111527273

Author:Philip J. Pratt

Publisher:Philip J. Pratt

Chapter6: Updating Data

Section: Chapter Questions

Problem 4SCG

See similar textbooks

Similar questions

Homework2 (1 solution Using Python A database has 5 transactions. Let min_sup = 60 % and min_conf = 80 % . TID T100 T200 T300 T400 T500 (a) Find all frequent itemsets using Apriori items_bought {M, O, N, K, E, Y} { D, O, N, K, E, Y} { M, A, K, E }{M,U,C,K,Y}{C,0,0,K, 1, E}(b) List all of the strong association rules (with supports and confidence c) matching the following metarule , where X is a variable representing customers , and item , denotes variables representing items ( eg,"A","B", etc. ) : Va e transaction , buys ( X , item, ) A buys (X, item, ) → buys ( X , item3 ) ) [s,c] II
A database has four transactions. Let min_sup 60% and min_conf = 80%. TID Date Items Bought {K, A, B, D} 10/15/2018 (D, A, C, E, B} {С, А, В, E) (В, А, D} 100 10/15/2018 200 300 10/19/2018 400 10/22/2018 Find all frequent items using Apriori and FP-growth respectively. Compare the efficiency of the (i) two meaning process.
JoziCleaners is local cleaning service that is looking to upgrade their current operations by making use of a database to keep track of the teams, houses, clients and billings of each client per/week. Each house is cleaned by one or more teams. A team goes out to a particular house on a certain day of the week. Each cleaning team has a team leader. Every cleaner eams R150 per day, except the team leader who earns a unique amount. The report that the JoziCleaners' manager produced in Microsoft Excel is illustrated as a spreadsheet in Figure 1 below. Day Client Client Name Team Members Team Leader Leader Total Code ID Wage Monday Aeliana Gebahard T3 6. Jaymes Merrickson R 350 R 850 C10 Alfher Dareia T1 Geoffrey Glover R 250 R 750 C8 Felina Diodotus T2 Elmer Victorson R 300 R 700 Brutus Sigihild Sigibert Quirinus Brutus Sigihild C9 T4 Norris Mamadou R 400 R1 000 Tuesday CS T3 Jaymes Merrickson R 350 R 850 C9 T2 5 Elmer Victorson R 300 R 700 Alfher Dareia Duncan Gardyner Geoffrey Glover…
Luxury-Oriented Scenic Tours (LOST) provides guided tours to groups of visitors to theWashington, D.C. area. In recent years, LOST has grown quickly and is havingdifficulty keeping up with all of the various information needs of the company. Thecompany’s operations are as follows:LOST offers many different tours. For each tour, the tour name, approximatelength (in hours), and fee charged is needed. Guides are identified by anemployee ID, but the system should also record a guide’s name, home address,and date of hire. Guides take a test to be qualified to lead specific tours. It isimportant to know which guides are qualified to lead which tours and the datethat they completed the qualification test for each tour. A guide may be qualifiedto lead many different tours. A tour can have many different qualified guides.New guides may or may not be qualified to lead any tours, just as a new tour mayor may not have any qualified guides.Every tour must be designed to visit at least three…
A database has four transactions. Let min_support=60% and min conf=80% TID date Items_bought T100 10/15/99 {K,A,D,B} T200 10/15/2000 {D,A,C,E,B} T300 10/19/2000 {C,A,B,E} T400 10/22/99 {B,A,D} Find all frequent itemset using Apriori and FP-growth respectively, Compare the efficiency of two mining processes List all strong association rules (with support s and confidence c).
Database Systems Each branch of the Jaja restaurant has a mainstay menu that is very popular with customers, so information on the availability of the number of servings is needed to be able to serve orders. Here are two transactions that are ordering a food menu at the same time. T1: Start the transaction at time t1, read 10 servings of food stock at t2. Because ordering one portion, the stock is reduced by 1 at t3. On t6, update the stock count, and commit to t7. T2: Transaction T2 starts a transaction on t2, reads the number of stocks in t3 as many as 10. At t4 orders 3 portions. On t5 it updates the stock to 7 and then on t6 commits it. As a result of the T1 and T2 transactions above, there was an error in the amount of food stocks. Make a solution with 2PL. What kinds of problems happened? Give a reason why choosing this type of problem! How much food is still available?
4. Write the relation matrix for the relation R on the set (a,b.c.d.e.f) which is defined as follows: R={a,a), (a,b), (a,c), (b,a). (b,c). (c,a), (c,b), (d,d), (f.f).
A database has four transactions. Let min sup = 60% and min conf = 80%.cust ID TID items bought (in the form of brand-item category)01 T100 {King’s-Crab, Sunset-Milk, Dairyland-Cheese, Best-Bread}02 T200 {Best-Cheese, Dairyland-Milk, Goldenfarm-Apple, Tasty-Pie, Wonder-Bread}01 T300 {Westcoast-Apple, Dairyland-Milk, Wonder-Bread, Tasty-Pie}03 T400 {Wonder-Bread, Sunset-Milk, Dairyland-Cheese}(a) At the granularity of item category (e.g., itemi could be “Milk”), for the ruletemplate,∀X ∈ transaction, buys(X,item1) ∧ buys(X,item2) ⇒ buys(X,item3) [s,c],list the frequent k-itemset for the largest k, and all the strong association rules(with their support s and confidence c) containing the frequent k-itemset for thelargest k.(b) At the granularity of brand-item category (e.g., itemi could be “Sunset-Milk”),for the rule template,∀X ∈ customer, buys(X,item1) ∧ buys(X,item2) ⇒ buys(X,item3),list the frequent k-itemset for the largest k (but do not print any rules).
Problem 8-10 use the same database. Let a database application have the following entities Sales = (Customers, Salesperson, Retail Order, Items), which contains the information that a salesperson sells multiple items (tables, computers,...) to customers. There are many customers. There are many salesmen. There are many items. For example, John sells to Joe, Smith sells to Jane, The "Salesperson" will sale many times. The "Customer" can come back and buy items many times The "Retail Order" specifies which Salesperson sell to which customer. In each "Retail_Order", many items (tables, computers,...) can be sold Hint: This is very similar to one of your homework What is the relationship between Retail_Order and Items? One-to-many relationship None of the above One-to-one relationship Many-to-many relationship
no relatIYCS 3. Give a Z expression for the set of all people in the database who have no siblings in the database. arations through which
Consider an employee database with two relationsemployee (employee_name, street, city)works (employee_name, company_name, salary) where the primary keys are underlined. Write a function avg_salary that takes a company name as an argument and finds the average salary of employees at thatcompany. Then, write an SQL statement, using that function, to find companieswhose employees earn a higher salary, on average, than the average salary at“First Bank”.
The problems for this chapter use a database for a simple department store that sells items to customers and wants to keep track of the invoices, the selling price (if an item is on sale), and the sales tax (7%) to be collected on some items. Every customer and invoice are assigned unique numbers. All items have a Universal Product Code (UPC) number and bar-code assigned to each unique item. Food and non-carbonated beverages are not taxed, but clothing, home goods, and most other items are. The structure of the tables is described in the following crows foot ERD: