[pymvpa] Group level searchlight

[Pegah Kassraian Fard]

Many thanks, very useful indeed. A related question: So the input to the
groupwise calculations are the permutated searchlight maps from single
subjects - and computation-wise this seems to me to be quite a bottleneck,
given that one whole brain searchlight already takes several hours. Is
there any way to speed up this part?

On Fri, Oct 20, 2017 at 5:13 PM, Nick Oosterhof <
n.n.oosterhof at googlemail.com> wrote:

>
>
> On 20 October 2017 at 16:48, Pegah Kassraian Fard <pegahkf at gmail.com>
> wrote:
>
>> More concretely, I would be very interested in a non-parameteric test:
>> Permutation of train labels followed by cluster size correction, as for
>> instance presented in the paper "Statistical inference and multiple
>> testing correction in classification-based multi-voxel pattern analysis
>> (MVPA): random permutations and cluster size control":
>> <https://www.ncbi.nlm.nih.gov/pubmed/23041526>
>>
>>
> Something along these lines in provided in the GroupClusterThreshold class.
>
> See http://www.pymvpa.org/generated/mvpa2.algorithms.group_clusterthr.
> GroupClusterThreshold.html
>
> _______________________________________________
> Pkg-ExpPsy-PyMVPA mailing list
> Pkg-ExpPsy-PyMVPA at lists.alioth.debian.org
> http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-exppsy-pymvpa
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.alioth.debian.org/pipermail/pkg-exppsy-pymvpa/attachments/20171020/ac413e0b/attachment.html>