Pascal Workshop and Pascal Challenge: Type I and type II errors for Multiple Simultaneous Hypothesis Testing, Paris 2007
Multiple Simultaneous Hypothesis Testing is a main issue in many areas of information extraction:
- rule extraction,
- validation of genes influence,
- validation of spatio-temporal patterns extraction (e.g. in brain imaging),
- other forms of spatial or temporal data (e.g. spatial collocation rule),
- other multiple hypothesis testing).
In all above frameworks, the goal is to extract patterns such that some quantity of interest is significantly greater than some given threshold.
- in rule extraction, the goal typically is the extraction of rules with confidence, lift and support significantly higher than a given threshold;
- in multiple hypothesis testing, the goal typically is the extraction of significant comparisons among various averages simultaneously;
- in spatio-temporal patterns extraction, the goal typically is the extraction of smooth (spatio-temporal) subsets of [0,1]4 with correlation significantly higher than a given threshold.
Along these lines, a type I error is to extract an entity which does not satisfy the considered constraint while a type II error is to miss an entity which does satisfy the constraint. How to estimate, bound, or (even better !) reduce type I and type II errors are the goals of the proposed challenge.
VC-theory, empirical process and various approaches related to simultaneous hypothesis testings are fully relevant, as well as specific approaches, e.g. based on simulations, resamplings or probes. The challenge consists in extending previous results to the field of simultaneous hypothesis testing, or proposing new results specifically related to this topic.
We welcome survey papers related to type I and type II errors, and papers presenting new results, proposing theoretical bounds or smart empirical experiments. In the latter case, the experimental setting as well as the algorithmic principles and explicit criteria must be carefully described and discussed; the use of publicly available software will be much appreciated.
Detailed information can be found at the workshop website.