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
To start, we're given the range that x lies in: from -1 to 4. We know from the fact that 
that -1 will be <em /><em>included</em> in that range, so we mark -1 on the number line with a solid circle. We also know from 
that, while x can be any value <em>up to</em> 4, it does not <em>include </em>4. We indicate this by drawing a hollow circle around 4 on the number line. Since x can be <em>any value within this range</em>, we make that fact clear by drawing a bold line between the points -1 and 4 on the number line. I've attached an image of what our final graph would look like.
