Home | Trees | Indices | Help |
|
---|
|
Runs a scalar `DatasetMeasure` on all possible spheres of a certain size within a dataset. The idea for a searchlight algorithm stems from a paper by :ref:`Kriegeskorte et al. (2006) <KGB06>`.
|
|||
Inherited from |
|
|||
|
|||
|
|||
Inherited from Inherited from Inherited from Inherited from |
|
|||
spheresizes = StateVariable(enabled= False, doc= "Number of fe
|
|||
__doc__ = enhancedDocString('Searchlight', locals(), DatasetMe
|
|||
Inherited from Inherited from |
|
|||
Inherited from |
|
:Parameters: datameasure: callable Any object that takes a :class:`~mvpa.datasets.base.Dataset` and returns some measure when called. radius: float All features within the radius around the center will be part of a sphere. Provided dataset should have a metric assigned (for NiftiDataset, voxel size is used to provide such a metric, hence radius should be specified in mm). center_ids: list(int) List of feature ids (not coordinates) the shall serve as sphere centers. By default all features will be used. **kwargs In additions this class supports all keyword arguments of its base-class :class:`~mvpa.measures.base.DatasetMeasure`. .. note:: If `Searchlight` is used as `SensitivityAnalyzer` one has to make sure that the specified scalar `DatasetMeasure` returns large (absolute) values for high sensitivities and small (absolute) values for low sensitivities. Especially when using error functions usually low values imply high performance and therefore high sensitivity. This would in turn result in sensitivity maps that have low (absolute) values indicating high sensitivites and this conflicts with the intended behavior of a `SensitivityAnalyzer`.
|
|
|
spheresizes
|
__doc__
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Mon Apr 23 23:09:31 2012 | http://epydoc.sourceforge.net |