Given frequent itemset l and subset s of l, prove that the confidence of the rule "s’ => (l - s’)" cannot be more than the co
1 answer:
You might be interested in
Answer:go there and it will answer your question
<h2 />Step-by-step explanation:
