V-optimal histograms |
- A histogram of data with n bins
|
- Reduce n to b where
![](images/img870.png)
|
- Formally, assume a set V of n (sorted) values
having frequencies respectively
|
- Problem is to output another histogram H having b bins, i.e., b non-overlapping intervals on V
|
- Interval is of the form
and has a value ![](images/a.png)
|
- If value
, estimate of is ![](images/a.png)
|
- Error in estimation is distance
![](images/img877.png)
|