A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Histogramming Data Streams with Fast Per-Item Processing
[chapter]
2002
Lecture Notes in Computer Science
A v ector A of length N can be approximately represented by a histogram H, by writing 0; N as the non-overlapping union of B intervals Ij, assigning a value bj to Ij, and approximating Ai by Hi = bj for i 2 Ij. An optimal histogram representation Hopt consists of the choices of Ij and bj that minimize the sum-square-error kA , Hk 2 2 = P i jAi ,Hij 2 . Numerous applications in statistics, signal processing and databases rely on histograms; typically B is signi cantly smaller than N and, hence,
doi:10.1007/3-540-45465-9_58
fatcat:33aezxdlafchpbcax6h6obez6m