No this isn't the correct basis. See here for better information:
http://lib.stat.cmu.edu/S/Harrell/help/Hmisc/html/hoeffd.html and here for a very confused explanation: http://www.sfu.ca/sasdoc/sashtml/proc/zompmeth.htm On Sat, Apr 23, 2011 at 8:58 PM, Lance Norskog <[email protected]> wrote: > Chasing down Hoeffding as a similarity measure, the closest I've come > is the Hoeffding Bound or Additive Chernoff Bound. Page 2, right-hand > column has a description of the algorithm: > http://www.cs.washington.edu/homes/pedrod/papers/kdd00.pdf > > Is this the right base math? Given this formula for acceptable errors, > what would be the algorithm for a similarity measure? >
