[Research] subset selection problem

[Daniel B. Neill]

Hi Robin,

This is very similar to my current work on linear-time subset scanning 
(LTSS), so we should chat soon (I'll be back in town on Monday).  There 
are a couple fairly easy ways of showing that a function has the LTSS 
property, so we could give these a try.

Best,
Daniel


On Wed, 13 May 2009, Robin Sabhnani wrote:

> Hi,
>
> Here is the question:
>
> Imagine there are M pairs of numbers (a_1, b_1), (a_2, b_2) ... (a_m, b_m).
> For each subset m_1 of these M pairs we define a 2x2 table as follows:
>
> \sum a_i \sum b_i (i in m_1)
> \sum a_j \sum b_j (j in M - m_1)
>
> Is there a linear order algorithm in M to find the subset m_1 that yields
> the lowest p-value using fisher's exact test for the above 2x2 table?
>
> Any pointers/papers/ideas/thoughts will be helpful.
>
> Thanks in advance.
>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: Syndromic Surveillance 2008- LTSS, revised.pdf
Type: application/pdf
Size: 67930 bytes
Desc: ltss.pdf
URL: <https://mailman.srv.cs.cmu.edu/mailman/private/autonlab-research/attachments/20090513/f8db7499/attachment.pdf>