www-ai.cs.tu-dortmund.de/de/LEHRE/FACHPROJEKT/SS12/paper/outlier/aggarwal2011.pdf
results/goutlier/sensitivity_time.eps
/JPEG /GrayACSImageDict << /QFactor 0.76 /HSamples [2 1 1 2] /VSamples [2 1 1 2] >> /GrayImageDict << /QFactor 1.30 /HSamples [2 1 1 2] /VSamples [2 1 1 2] >> /JPEG2000GrayACSImageDict << /TileWidth 256 [...] 1 2] >> /ColorImageDict << /QFactor 1.30 /HSamples [2 1 1 2] /VSamples [2 1 1 2] >> /JPEG2000ColorACSImageDict << /TileWidth 256 /TileHeight 256 /Quality 10 >> /JPEG2000ColorImageDict << /TileWidth 256 [...] Let us consider two data sets D1 and D2, such that D2 ⊇ D1. Then, the stopping hash threshold H(f, h,D2, α) is at most equal to H(f, h,D1, α). In other words:
H(f, h,D2, α) ≤ H(f, h,D1, α) (3)
Proof: The …