• Corpus ID: 227238858

Permutation-based true discovery proportions for fMRI cluster analysis.

  title={Permutation-based true discovery proportions for fMRI cluster analysis.},
  author={Angela Andreella and Jesse Hemerik and Wouter D. Weeda and Livio Finos and Jelle J. Goeman},
  journal={arXiv: Applications},
We develop a general permutation-based closed testing method to compute a simultaneous lower confidence bound for the true discovery proportions of all possible subsets of a hypothesis testing problem. It is particularly useful in functional Magnetic Resonance Imaging cluster analysis, where it is of interest to select a cluster of voxels and to provide a confidence statement on the percentage of truly activated voxels within that cluster, avoiding the well-known spatial specificity paradox. We… 
Notip: Non-parametric True Discovery Proportion estimation for brain imaging
Notip is obtained: a powerful, non-parametric method that yields statistically valid estimation of the proportion of activated voxels in data-derived clusters and leverages randomization methods to adapt to data characteristics and obtain tighter false discovery control.
Adaptive Cluster Thresholding with Spatial Activation Guarantees Using All-resolutions Inference
An algorithm is proposed that outputs all maximal supra-threshold clusters, for which ARI gives a TDP lower confidence bound that is at least a chosen threshold, for any number of thresholds that need not be chosen a priori nor all at once.
Permutation-Based True Discovery Guarantee by Sum Tests
Sum-based global tests are highly popular in multiple hypothesis testing. In this paper we propose a general closed testing procedure for sum tests, which provides confidence lower bounds for the
Powerful and interpretable control of false discoveries in differential expression studies
This paper formalizes the use of permutation-based methods to obtain sharp confidence bounds that are adaptive to the dependence between genes, and introduces a generic linear time algorithm for computing post hoc bounds applicable to large-scale DE studies.
Faster Exact Permutation Testing: Using a Representative Subgroup
Non-parametric tests based on permutation, rotation or sign-flipping are examples of so-called group-invariance tests. These tests rely on invariance of the null distribution under a set of


Controlling the familywise error rate in functional neuroimaging: a comparative review
It is found that Bonferroni-related tests offer little improvement over Bonferronsi, while the permutation method offers substantial improvement over the random field method for low smoothness and low degrees of freedom.
Cluster failure revisited: Impact of first level design and physiological noise on cluster false positive rates
It is found that the combination of a two‐sided test and cleaning the data using ICA FIX resulted in nominal false positive rates for all data sets, meaning that data cleaning is not only important for resting state fMRI, but also for task fMRI.
Simultaneous control of all false discovery proportions in large-scale multiple hypothesis testing
Closed testing procedures are classically used for familywise error rate control, but they can also be used to obtain simultaneous confidence bounds for the false discovery proportion in all
Permutation-based simultaneous confidence bounds for the false discovery proportion
In this paper, confidence upper bounds for the false discovery proportion are constructed, which are simultaneous over all rejection cut-offs, and a generalization of the method is provided that lets the user select the shape of the simultaneous confidence bounds; this gives the user more freedom in determining the power properties of the methods.
Non‐parametric combination and related permutation tests for neuroimaging
This work proposes and evaluates a modification of the recently introduced non‐parametric combination (NPC) methodology, such that instead of a two‐phase algorithm and large data storage requirements, the inference can be performed in a single phase, with reasonable computational demands.
Controlling the false discovery rate: a practical and powerful approach to multiple testing
SUMMARY The common approach to the multiplicity problem calls for controlling the familywise error rate (FWER). This approach, though, has faults, and we point out a few. A different approach to