www-ai.cs.tu-dortmund.de/LEHRE/SEMINARE/SS09/AKTARBEITENDESDM/LITERATUR/item_sets_that_compress.pdf
sets:
• CS1 = {{I1, 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 [...] space, given in 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 [...] sets. C is in standard order for db i! for any two J1, J2 ! C
• size(J1) - size(J2) ( J2 .C J1;
• size(J1) = size(J2) / suppdb(J1) - suppdb(J2)) ( J2 .C J1.
While we use the standard order for the code table …