www-ai.cs.tu-dortmund.de/de/LEHRE/VORLESUNGEN/KDD/SS15/UEBUNG/h4.pdf
Punkt) Which set of films is the closure of {Simpsons (Film)}?
2. (3 Punkte) Last week, we have seen that with a minimum support of 3 5 , the frequent
itemsets are (using the one-letter representation [...] . . , z10, in the transaction database extracted from the following table:
Rep. Titel Jahr z1 z2 z3 z4 z5 z6 z7 z8 z9 z10
a Star Wars 1977 1 1 0 0 1 0 1 0 1 1
b E.T. der Ausserirdische 1982 1 1 0 1 1 [...] closure of any proper subset of S. Formally, S is free if and only if:
S ′ ⊂ S ⇒ S 6⊆ closure(S ′)
3. (2 Punkte) Which of the itemsets {a, b}, {b, c}, {b, f} are free?
Aufgabe 4.2 (4 Punkte) Consider the …