Section 4.2.2 describes a method for generating association rules from frequent itemsets. Propose a more efficient method.

Question:

Section 4.2.2 describes a method for generating association rules from frequent itemsets. Propose a more efficient method. Explain why it is more efficient than the one proposed there. (consider incorporating the properties of Exercises 4.3(b), (c) into your design.)

Section 4.2.2

Once the frequent itemsets from transactions in a database D have been found, it is straightforward to

Exercises 4.3

b. Prove that the support of any nonempty subset \(s^{\prime}\) of itemset \(s\) must be at least as great as the support of \(s\).

c. Given frequent itemset \(l\) and subset \(s\) of \(l\), prove that the confidence of the rule " \(s\) ' \(\Rightarrow\) \(\left(l-s^{\prime}ight)\) " cannot be more than the confidence of " \(s \Rightarrow(l-s)\)," where \(s^{\prime}\) is a subset of \(s\).

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Data Mining Concepts And Techniques

ISBN: 9780128117613

4th Edition

Authors: Jiawei Han, Jian Pei, Hanghang Tong

Question Posted: