an Apriori algorithm, Database Management System

Assignment Help:
Submission Requirements
All answers must be computer generated (including text and diagrams).
The hand-in version must include a header page (or with sufficient space) indicating: student name, course number and assignment number.

Question 1(90 pts): The transactions are presented in the table. Let min sup =3 and min conf = 80%.

TID items bought
T1 I1,I1,I2,I3,I4, I5, I6
T2 I7, I2, I3, I4, I5, I6
T3 I1, I8, I4, I5
T4 I1, I9, I10, I4, I6
T5 I10, I2, I2, I4, I 5








(a) Use an Apriori algorithm to find all frequent itemsets.
(b) Use an FP-growth algorithm to find all frequent itemsets.
(c) Find all of the strong association rules. Provide support, confidence, and lift for all the rule. Provide the reasons why the rules you selected are interesting.


Related Discussions:- an Apriori algorithm

Designing the fields in the data base, Designing the fields in the data bas...

Designing the fields in the data base The following are the considerations one has to remain in mind while designing the fields in the data base. Coding, compression, en

Functional dependencies, 1. Staff (staffID --> availabilityID) 2. Servic...

1. Staff (staffID --> availabilityID) 2. Services (servicesID --> itemBasedID --> timedBasedID) 3. TimedBased (timedbasedID--> priceid) 4. Clients (clientId, serviceId-->

Execute sql queries, Consider the relations described below: PHYSICIAN (re...

Consider the relations described below: PHYSICIAN (regno, name, telno, city) PATIENT (pname, street, city) VISIT (pname, regno, date_of_visit, fee) Where the regno and pname ide

Explain the concept of deadlock, Question: In a multi-user database env...

Question: In a multi-user database environment, locking mechanisms can be used to solve the three basic problems of concurrency. On the other hand, however, locking may also le

What is system catalog or catalog relation, What is system catalog or catal...

What is system catalog or catalog relation? How is better known as? A RDBMS maintains a explanation of all the data that it contains, information about every relation and index

Selective replication-data replication, Selective replication: This is a c...

Selective replication: This is a combination of generating small fragments of relation and replicating them rather than a entire relation. The data should be fragmented on require

Define the canonical cover, Define the Canonical cover Ans: A canonical...

Define the Canonical cover Ans: A canonical cover F c for F is a set of dependencies like F logically implies all dependencies in F c , and F c logically entails all dependen

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd