www-ai.cs.tu-dortmund.de/de/LEHRE/SEMINARE/SS09/AKTARBEITENDESDM/LITERATUR/item_sets_that_compress.pdf
I2}, {I1}, {I2}, {I3}}
• CS2 = {{I1, I2, I3}, {I1, I2}, {I1}, {I2}, {I3}}
• CS3 = {{I1, I2, I3}, {I1}, {I2}, {I3}}
Assume that supp({I1, I2, I3}) = supp({I1, I2}) + 1. It is very well possible that LCS2(db) [...] set, K a set of codes and db a database. CT # C ,K is a code table for db i!
• &(c1, k1), (c2, k2) ! CT : c1 = c2 ( k1 = k2
• &(c, k) ! CT : L(k) = + log(P (c)) where P (c) is the probability of c in the [...] Lemma 2.5.
397
Lemma 2.5. Let J1 and J2 be two proto coding sets such that J1 " J2, then
LC(J1)(db) $ LC(J2)(db)
Proof. Any coding set in J1 is also a coding set in J2.
This lemma doesn’t suggest a pruning …