A database has four transactions. Let min_sup (^{text {4 }}=60 %) and min_conf (^{text {s }}=80 %).
Question:
A database has four transactions. Let min_sup \(^{\text {4 }}=60 \%\) and min_conf \(^{\text {s }}=80 \%\).
a. At the granularity of item_category (e.g., item \({ }_{i}\) could be "Milk"), for the rule template,
\[
\forall X \in \text { transaction, buys }\left(X, \text { item }_{1}ight) \wedge \operatorname{buys}\left(X, \text { item }_{2}ight) \Rightarrow \text { buys }\left(X, \text { item }_{3}ight) \quad[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 the largest \(k\).
b. At the granularity of brand-item_category (e.g., item \({ }_{i}\) could be "Sunset-Milk"), for the rule template,
\[
\forall X \in \text { customer, } \operatorname{buys}\left(X, \text { item }_{1}ight) \wedge \operatorname{buys}\left(X, \text { item }_{2}ight) \Rightarrow \text { buys }\left(X, \text { item }_{3}ight),
\]
list the frequent \(k\)-itemset for the largest \(k\) (but do not print any rules).
Step by Step Answer:
Data Mining Concepts And Techniques
ISBN: 9780128117613
4th Edition
Authors: Jiawei Han, Jian Pei, Hanghang Tong