Competitive Closeness Testing
published: Aug. 2, 2011, recorded: July 2011, views: 3133
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
We test whether two sequences are generated by the same distribution or by two different ones. Unlike previous work, we make no assumptions on the distributions' support size. Additionally, we compare our performance to that of the best possible test. We describe an efficiently-computable algorithm based on pattern maximum likelihood that is near optimal whenever the best possible error probability is < exp(-14n2/3) using length-n sequences.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !