Suppose we have market basket data consisting of 100 transactions and 20 items. Compute the total number of possible association rules. If the support for item A is 25%, the support for item B is 90% and the support for itemset {A,B} is 20%. Let the support and conﬁdence thresholds be 10% and 60%, respectively. Compute the conﬁdence of the association rule {A} → {B} & {B} → {A}.Consider the following data of software repository which represents set of source files changed together in six different transactions (TID). Transaction is an event in which developers change one or more source files together to incorporate changes in software. Table-1TIDItems (source files change together)1File1, File2, File32File1, File23File1, File4, File54File5, File45File5, File36File1, File4, File5Use Table-1 data and apply APRIORI algorithm to find the most frequent association rules which can be used to predict those source files which are most frequently change together. The minimum support and confidence values are 33.34% and 60.0% respectively.

Solution (a) Number of transactions =100 Number of item =20 Total number of association rule=…

Answered: Suppose we have market basket data…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Suppose we have market basket data consisting of 100 transactions and 20 items. Compute the total number of possible association rules. If the support for item A is 25%, the support for item B is 90% and the support for itemset {A,B} is 20%. Let the support and conﬁdence thresholds be 10% and 60%, respectively. Compute the conﬁdence of the association rule {A} → {B} & {B} → {A}.
Consider the following data of software repository which represents set of source files changed together in six different transactions (TID). Transaction is an event in which developers change one or more source files together to incorporate changes in software.

Table-1

TID	Items (source files change together)
1	File1, File2, File3
2	File1, File2
3	File1, File4, File5
4	File5, File4
5	File5, File3
6	File1, File4, File5

Use Table-1 data and apply APRIORI algorithm to find the most frequent association rules which can be used to predict those source files which are most frequently change together. The minimum support and confidence values are 33.34% and 60.0% respectively.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 6 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions