Content deleted Content added
m removed broken links, fixed some grammar |
m offset,type->offset, type - Fix a typo in one click Tags: Mobile edit Mobile web edit Advanced mobile edit |
||
Line 9:
Given ''M'' intervals of the form ''c'' ± ''r'' (which means [''c''−''r'',''c''+''r'']), the algorithm seeks to find an interval with ''M''−''f'' sources. The value ''f'' is referred to as the number of falsetickers, those sources which are in error (the actual value is outside the [[confidence band]]). The best estimate is that which assumes the least number of falsetickers, ''f''. The results will be considered valid if ''f'' < ''M''/2, otherwise the algorithm will return failure instead of an interval.
The intersection algorithm begins by creating a table of tuples <offset, type>. For each interval there are three entries: the lower endpoint, the midpoint and the upper endpoint, labelled with types −1, 0 and +1 respectively. Thus the interval ''c'' ± ''r'' results in the entries <''c''−''r'',−1>, <''c'',0> and <''c''+''r'',+1>. These entries are then sorted by offset.
Variables: This algorithm uses ''f'' as number of false tickers, ''endcount'' and ''midcount'' are integers. ''Lower'' and ''upper'' are values of offsets.
| |||