Note

Click here to download the full example code

# Decoding (MVPA)#

## Design philosophy#

Decoding (a.k.a. MVPA) in MNE largely follows the machine
learning API of the scikit-learn package.
Each estimator implements `fit`

, `transform`

, `fit_transform`

, and
(optionally) `inverse_transform`

methods. For more details on this design,
visit scikit-learn. For additional theoretical insights into the decoding
framework in MNE 1.

For ease of comprehension, we will denote instantiations of the class using the same name as the class but in small caps instead of camel cases.

Let’s start by loading data for a simple two-class problem:

sphinx_gallery_thumbnail_number = 6

```
import numpy as np
import matplotlib.pyplot as plt
from sklearn.pipeline import make_pipeline
from sklearn.preprocessing import StandardScaler
from sklearn.linear_model import LogisticRegression
import mne
from mne.datasets import sample
from mne.decoding import (SlidingEstimator, GeneralizingEstimator, Scaler,
cross_val_multiscore, LinearModel, get_coef,
Vectorizer, CSP)
data_path = sample.data_path()
subjects_dir = data_path / 'subjects'
meg_path = data_path / 'MEG' / 'sample'
raw_fname = meg_path / 'sample_audvis_filt-0-40_raw.fif'
tmin, tmax = -0.200, 0.500
event_id = {'Auditory/Left': 1, 'Visual/Left': 3} # just use two
raw = mne.io.read_raw_fif(raw_fname)
raw.pick_types(meg='grad', stim=True, eog=True, exclude=())
# The subsequent decoding analyses only capture evoked responses, so we can
# low-pass the MEG data. Usually a value more like 40 Hz would be used,
# but here low-pass at 20 so we can more heavily decimate, and allow
# the example to run faster. The 2 Hz high-pass helps improve CSP.
raw.load_data().filter(2, 20)
events = mne.find_events(raw, 'STI 014')
# Set up bad channels (modify to your needs)
raw.info['bads'] += ['MEG 2443'] # bads + 2 more
# Read epochs
epochs = mne.Epochs(raw, events, event_id, tmin, tmax, proj=True,
picks=('grad', 'eog'), baseline=(None, 0.), preload=True,
reject=dict(grad=4000e-13, eog=150e-6), decim=3,
verbose='error')
epochs.pick_types(meg=True, exclude='bads') # remove stim and EOG
del raw
X = epochs.get_data() # MEG signals: n_epochs, n_meg_channels, n_times
y = epochs.events[:, 2] # target: auditory left vs visual left
```

```
Opening raw data file /home/circleci/mne_data/MNE-sample-data/MEG/sample/sample_audvis_filt-0-40_raw.fif...
Read a total of 4 projection items:
PCA-v1 (1 x 102) idle
PCA-v2 (1 x 102) idle
PCA-v3 (1 x 102) idle
Average EEG reference (1 x 60) idle
Range : 6450 ... 48149 = 42.956 ... 320.665 secs
Ready.
Removing projector <Projection | PCA-v1, active : False, n_channels : 102>
Removing projector <Projection | PCA-v2, active : False, n_channels : 102>
Removing projector <Projection | PCA-v3, active : False, n_channels : 102>
Removing projector <Projection | Average EEG reference, active : False, n_channels : 60>
Reading 0 ... 41699 = 0.000 ... 277.709 secs...
Filtering raw data in 1 contiguous segment
Setting up band-pass filter from 2 - 20 Hz
FIR filter parameters
---------------------
Designing a one-pass, zero-phase, non-causal bandpass filter:
- Windowed time-domain design (firwin) method
- Hamming window with 0.0194 passband ripple and 53 dB stopband attenuation
- Lower passband edge: 2.00
- Lower transition bandwidth: 2.00 Hz (-6 dB cutoff frequency: 1.00 Hz)
- Upper passband edge: 20.00 Hz
- Upper transition bandwidth: 5.00 Hz (-6 dB cutoff frequency: 22.50 Hz)
- Filter length: 249 samples (1.658 sec)
[Parallel(n_jobs=1)]: Using backend SequentialBackend with 1 concurrent workers.
[Parallel(n_jobs=1)]: Done 1 out of 1 | elapsed: 0.0s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 2 out of 2 | elapsed: 0.0s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 3 out of 3 | elapsed: 0.0s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 4 out of 4 | elapsed: 0.0s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 204 out of 204 | elapsed: 0.4s finished
319 events found
Event IDs: [ 1 2 3 4 5 32]
```

## Transformation classes#

### Scaler#

The `mne.decoding.Scaler`

will standardize the data based on channel
scales. In the simplest modes `scalings=None`

or `scalings=dict(...)`

,
each data channel type (e.g., mag, grad, eeg) is treated separately and
scaled by a constant. This is the approach used by e.g.,
`mne.compute_covariance()`

to standardize channel scales.

If `scalings='mean'`

or `scalings='median'`

, each channel is scaled using
empirical measures. Each channel is scaled independently by the mean and
standand deviation, or median and interquartile range, respectively, across
all epochs and time points during `fit`

(during training). The `transform()`

method is
called to transform data (training or test set) by scaling all time points
and epochs on a channel-by-channel basis. To perform both the `fit`

and
`transform`

operations in a single call, the
`fit_transform()`

method may be used. To invert the
transform, `inverse_transform()`

can be used. For
`scalings='median'`

, scikit-learn version 0.17+ is required.

Note

Using this class is different from directly applying
`sklearn.preprocessing.StandardScaler`

or
`sklearn.preprocessing.RobustScaler`

offered by
scikit-learn. These scale each *classification feature*, e.g.
each time point for each channel, with mean and standard
deviation computed across epochs, whereas
`mne.decoding.Scaler`

scales each *channel* using mean and
standard deviation computed across all of its time points
and epochs.

### Vectorizer#

Scikit-learn API provides functionality to chain transformers and estimators
by using `sklearn.pipeline.Pipeline`

. We can construct decoding
pipelines and perform cross-validation and grid-search. However scikit-learn
transformers and estimators generally expect 2D data
(n_samples * n_features), whereas MNE transformers typically output data
with a higher dimensionality
(e.g. n_samples * n_channels * n_frequencies * n_times). A Vectorizer
therefore needs to be applied between the MNE and the scikit-learn steps
like:

```
# Uses all MEG sensors and time points as separate classification
# features, so the resulting filters used are spatio-temporal
clf = make_pipeline(
Scaler(epochs.info),
Vectorizer(),
LogisticRegression(solver='liblinear') # liblinear is faster than lbfgs
)
scores = cross_val_multiscore(clf, X, y, cv=5, n_jobs=None)
# Mean scores across cross-validation splits
score = np.mean(scores, axis=0)
print('Spatio-temporal: %0.1f%%' % (100 * score,))
```

```
[Parallel(n_jobs=1)]: Using backend SequentialBackend with 1 concurrent workers.
[Parallel(n_jobs=1)]: Done 1 out of 1 | elapsed: 0.2s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 2 out of 2 | elapsed: 0.3s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 3 out of 3 | elapsed: 0.5s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 4 out of 4 | elapsed: 0.6s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 5 out of 5 | elapsed: 0.7s finished
Spatio-temporal: 99.2%
```

### PSDEstimator#

The `mne.decoding.PSDEstimator`

computes the power spectral density (PSD) using the multitaper
method. It takes a 3D array as input, converts it into 2D and computes the
PSD.

### FilterEstimator#

The `mne.decoding.FilterEstimator`

filters the 3D epochs data.

## Spatial filters#

Just like temporal filters, spatial filters provide weights to modify the data along the sensor dimension. They are popular in the BCI community because of their simplicity and ability to distinguish spatially-separated neural activity.

### Common spatial pattern#

`mne.decoding.CSP`

is a technique to analyze multichannel data based
on recordings from two classes 2 (see also
https://en.wikipedia.org/wiki/Common_spatial_pattern).

Let \(X \in R^{C\times T}\) be a segment of data with \(C\) channels and \(T\) time points. The data at a single time point is denoted by \(x(t)\) such that \(X=[x(t), x(t+1), ..., x(t+T-1)]\). Common spatial pattern (CSP) finds a decomposition that projects the signal in the original sensor space to CSP space using the following transformation:

where each column of \(W \in R^{C\times C}\) is a spatial filter and each row of \(x_{CSP}\) is a CSP component. The matrix \(W\) is also called the de-mixing matrix in other contexts. Let \(\Sigma^{+} \in R^{C\times C}\) and \(\Sigma^{-} \in R^{C\times C}\) be the estimates of the covariance matrices of the two conditions. CSP analysis is given by the simultaneous diagonalization of the two covariance matrices

where \(\lambda^{C}\) is a diagonal matrix whose entries are the eigenvalues of the following generalized eigenvalue problem

Large entries in the diagonal matrix corresponds to a spatial filter which gives high variance in one class but low variance in the other. Thus, the filter facilitates discrimination between the two classes.

Examples

Note

The winning entry of the Grasp-and-lift EEG competition in Kaggle used
the `CSP`

implementation in MNE and was featured as
a script of the week.

We can use CSP with these data with:

```
csp = CSP(n_components=3, norm_trace=False)
clf_csp = make_pipeline(
csp,
LinearModel(LogisticRegression(solver='liblinear'))
)
scores = cross_val_multiscore(clf_csp, X, y, cv=5, n_jobs=None)
print('CSP: %0.1f%%' % (100 * scores.mean(),))
```

```
[Parallel(n_jobs=1)]: Using backend SequentialBackend with 1 concurrent workers.
Computing rank from data with rank=None
Using tolerance 4e-11 (2.2e-16 eps * 203 dim * 8.9e+02 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
Computing rank from data with rank=None
Using tolerance 4.7e-11 (2.2e-16 eps * 203 dim * 1e+03 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
[Parallel(n_jobs=1)]: Done 1 out of 1 | elapsed: 0.4s remaining: 0.0s
Computing rank from data with rank=None
Using tolerance 3.8e-11 (2.2e-16 eps * 203 dim * 8.5e+02 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
Computing rank from data with rank=None
Using tolerance 4.8e-11 (2.2e-16 eps * 203 dim * 1.1e+03 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
[Parallel(n_jobs=1)]: Done 2 out of 2 | elapsed: 0.6s remaining: 0.0s
Computing rank from data with rank=None
Using tolerance 3.9e-11 (2.2e-16 eps * 203 dim * 8.6e+02 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
Computing rank from data with rank=None
Using tolerance 4.7e-11 (2.2e-16 eps * 203 dim * 1e+03 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
[Parallel(n_jobs=1)]: Done 3 out of 3 | elapsed: 0.9s remaining: 0.0s
Computing rank from data with rank=None
Using tolerance 3.9e-11 (2.2e-16 eps * 203 dim * 8.6e+02 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
Computing rank from data with rank=None
Using tolerance 4.5e-11 (2.2e-16 eps * 203 dim * 1e+03 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
[Parallel(n_jobs=1)]: Done 4 out of 4 | elapsed: 1.2s remaining: 0.0s
Computing rank from data with rank=None
Using tolerance 3.8e-11 (2.2e-16 eps * 203 dim * 8.5e+02 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
Computing rank from data with rank=None
Using tolerance 4.7e-11 (2.2e-16 eps * 203 dim * 1e+03 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
[Parallel(n_jobs=1)]: Done 5 out of 5 | elapsed: 1.5s finished
CSP: 89.4%
```

### Source power comodulation (SPoC)#

Source Power Comodulation (`mne.decoding.SPoC`

)
3 identifies the composition of
orthogonal spatial filters that maximally correlate with a continuous target.

SPoC can be seen as an extension of the CSP where the target is driven by a continuous variable rather than a discrete variable. Typical applications include extraction of motor patterns using EMG power or audio patterns using sound envelope.

Examples

### xDAWN#

`mne.preprocessing.Xdawn`

is a spatial filtering method designed to
improve the signal to signal + noise ratio (SSNR) of the ERP responses
4. Xdawn was originally
designed for P300 evoked potential by enhancing the target response with
respect to the non-target response. The implementation in MNE-Python is a
generalization to any type of ERP.

### Effect-matched spatial filtering#

The result of `mne.decoding.EMS`

is a spatial filter at each time
point and a corresponding time course 5.
Intuitively, the result gives the similarity between the filter at
each time point and the data vector (sensors) at that time point.

### Patterns vs. filters#

When interpreting the components of the CSP (or spatial filters in general), it is often more intuitive to think about how \(x(t)\) is composed of the different CSP components \(x_{CSP}(t)\). In other words, we can rewrite Equation (1) as follows:

The columns of the matrix \((W^{-1})^T\) are called spatial patterns. This is also called the mixing matrix. The example Linear classifier on sensor data with plot patterns and filters discusses the difference between patterns and filters.

These can be plotted with:

```
# Fit CSP on full data and plot
csp.fit(X, y)
csp.plot_patterns(epochs.info)
csp.plot_filters(epochs.info, scalings=1e-9)
```

```
Computing rank from data with rank=None
Using tolerance 4.3e-11 (2.2e-16 eps * 203 dim * 9.6e+02 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
Computing rank from data with rank=None
Using tolerance 5.2e-11 (2.2e-16 eps * 203 dim * 1.2e+03 max singular value)
Estimated rank (mag): 203
MAG: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
```

## Decoding over time#

This strategy consists in fitting a multivariate predictive model on each
time instant and evaluating its performance at the same instant on new
epochs. The `mne.decoding.SlidingEstimator`

will take as input a
pair of features \(X\) and targets \(y\), where \(X\) has
more than 2 dimensions. For decoding over time the data \(X\)
is the epochs data of shape n_epochs x n_channels x n_times. As the
last dimension of \(X\) is the time, an estimator will be fit
on every time instant.

This approach is analogous to SlidingEstimator-based approaches in fMRI, where here we are interested in when one can discriminate experimental conditions and therefore figure out when the effect of interest happens.

When working with linear models as estimators, this approach boils down to estimating a discriminative spatial filter for each time instant.

### Temporal decoding#

We’ll use a Logistic Regression for a binary classification as machine learning model.

```
# We will train the classifier on all left visual vs auditory trials on MEG
clf = make_pipeline(
StandardScaler(),
LogisticRegression(solver='liblinear')
)
time_decod = SlidingEstimator(
clf, n_jobs=None, scoring='roc_auc', verbose=True)
# here we use cv=3 just for speed
scores = cross_val_multiscore(time_decod, X, y, cv=3, n_jobs=None)
# Mean scores across cross-validation splits
scores = np.mean(scores, axis=0)
# Plot
fig, ax = plt.subplots()
ax.plot(epochs.times, scores, label='score')
ax.axhline(.5, color='k', linestyle='--', label='chance')
ax.set_xlabel('Times')
ax.set_ylabel('AUC') # Area Under the Curve
ax.legend()
ax.axvline(.0, color='k', linestyle='-')
ax.set_title('Sensor space decoding')
```

```
[Parallel(n_jobs=1)]: Using backend SequentialBackend with 1 concurrent workers.
0%| | Fitting SlidingEstimator : 0/36 [00:00<?, ?it/s]
14%|#3 | Fitting SlidingEstimator : 5/36 [00:00<00:00, 146.09it/s]
28%|##7 | Fitting SlidingEstimator : 10/36 [00:00<00:00, 146.85it/s]
42%|####1 | Fitting SlidingEstimator : 15/36 [00:00<00:00, 147.28it/s]
64%|######3 | Fitting SlidingEstimator : 23/36 [00:00<00:00, 171.38it/s]
83%|########3 | Fitting SlidingEstimator : 30/36 [00:00<00:00, 179.33it/s]
100%|##########| Fitting SlidingEstimator : 36/36 [00:00<00:00, 187.89it/s]
100%|##########| Fitting SlidingEstimator : 36/36 [00:00<00:00, 184.57it/s]
[Parallel(n_jobs=1)]: Using backend SequentialBackend with 1 concurrent workers.
[Parallel(n_jobs=1)]: Done 1 out of 1 | elapsed: 0.0s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 1 out of 1 | elapsed: 0.0s finished
[Parallel(n_jobs=1)]: Done 1 out of 1 | elapsed: 0.3s remaining: 0.0s
0%| | Fitting SlidingEstimator : 0/36 [00:00<?, ?it/s]
11%|#1 | Fitting SlidingEstimator : 4/36 [00:00<00:00, 117.88it/s]
25%|##5 | Fitting SlidingEstimator : 9/36 [00:00<00:00, 133.32it/s]
44%|####4 | Fitting SlidingEstimator : 16/36 [00:00<00:00, 159.25it/s]
67%|######6 | Fitting SlidingEstimator : 24/36 [00:00<00:00, 180.20it/s]
89%|########8 | Fitting SlidingEstimator : 32/36 [00:00<00:00, 192.52it/s]
100%|##########| Fitting SlidingEstimator : 36/36 [00:00<00:00, 195.61it/s]
100%|##########| Fitting SlidingEstimator : 36/36 [00:00<00:00, 191.90it/s]
[Parallel(n_jobs=1)]: Using backend SequentialBackend with 1 concurrent workers.
[Parallel(n_jobs=1)]: Done 1 out of 1 | elapsed: 0.0s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 1 out of 1 | elapsed: 0.0s finished
[Parallel(n_jobs=1)]: Done 2 out of 2 | elapsed: 0.5s remaining: 0.0s
0%| | Fitting SlidingEstimator : 0/36 [00:00<?, ?it/s]
17%|#6 | Fitting SlidingEstimator : 6/36 [00:00<00:00, 176.86it/s]
39%|###8 | Fitting SlidingEstimator : 14/36 [00:00<00:00, 207.55it/s]
61%|######1 | Fitting SlidingEstimator : 22/36 [00:00<00:00, 217.91it/s]
83%|########3 | Fitting SlidingEstimator : 30/36 [00:00<00:00, 223.03it/s]
100%|##########| Fitting SlidingEstimator : 36/36 [00:00<00:00, 219.59it/s]
100%|##########| Fitting SlidingEstimator : 36/36 [00:00<00:00, 218.52it/s]
[Parallel(n_jobs=1)]: Using backend SequentialBackend with 1 concurrent workers.
[Parallel(n_jobs=1)]: Done 1 out of 1 | elapsed: 0.0s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 1 out of 1 | elapsed: 0.0s finished
[Parallel(n_jobs=1)]: Done 3 out of 3 | elapsed: 0.7s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 3 out of 3 | elapsed: 0.7s finished
```

You can retrieve the spatial filters and spatial patterns if you explicitly use a LinearModel

```
clf = make_pipeline(
StandardScaler(),
LinearModel(LogisticRegression(solver='liblinear'))
)
time_decod = SlidingEstimator(
clf, n_jobs=None, scoring='roc_auc', verbose=True)
time_decod.fit(X, y)
coef = get_coef(time_decod, 'patterns_', inverse_transform=True)
evoked_time_gen = mne.EvokedArray(coef, epochs.info, tmin=epochs.times[0])
joint_kwargs = dict(ts_args=dict(time_unit='s'),
topomap_args=dict(time_unit='s'))
evoked_time_gen.plot_joint(times=np.arange(0., .500, .100), title='patterns',
**joint_kwargs)
```

```
0%| | Fitting SlidingEstimator : 0/36 [00:00<?, ?it/s]
8%|8 | Fitting SlidingEstimator : 3/36 [00:00<00:00, 87.12it/s]
17%|#6 | Fitting SlidingEstimator : 6/36 [00:00<00:00, 87.83it/s]
28%|##7 | Fitting SlidingEstimator : 10/36 [00:00<00:00, 98.48it/s]
39%|###8 | Fitting SlidingEstimator : 14/36 [00:00<00:00, 103.73it/s]
53%|#####2 | Fitting SlidingEstimator : 19/36 [00:00<00:00, 113.39it/s]
67%|######6 | Fitting SlidingEstimator : 24/36 [00:00<00:00, 119.92it/s]
78%|#######7 | Fitting SlidingEstimator : 28/36 [00:00<00:00, 119.69it/s]
89%|########8 | Fitting SlidingEstimator : 32/36 [00:00<00:00, 119.52it/s]
100%|##########| Fitting SlidingEstimator : 36/36 [00:00<00:00, 120.00it/s]
100%|##########| Fitting SlidingEstimator : 36/36 [00:00<00:00, 118.35it/s]
No projector specified for this dataset. Please consider the method self.add_proj.
```

### Temporal generalization#

Temporal generalization is an extension of the decoding over time approach. It consists in evaluating whether the model estimated at a particular time instant accurately predicts any other time instant. It is analogous to transferring a trained model to a distinct learning problem, where the problems correspond to decoding the patterns of brain activity recorded at distinct time instants.

The object to for Temporal generalization is
`mne.decoding.GeneralizingEstimator`

. It expects as input \(X\)
and \(y\) (similarly to `SlidingEstimator`

) but
generates predictions from each model for all time instants. The class
`GeneralizingEstimator`

is generic and will treat the
last dimension as the one to be used for generalization testing. For
convenience, here, we refer to it as different tasks. If \(X\)
corresponds to epochs data then the last dimension is time.

This runs the analysis used in 6 and further detailed in 7:

```
# define the Temporal generalization object
time_gen = GeneralizingEstimator(clf, n_jobs=None, scoring='roc_auc',
verbose=True)
# again, cv=3 just for speed
scores = cross_val_multiscore(time_gen, X, y, cv=3, n_jobs=None)
# Mean scores across cross-validation splits
scores = np.mean(scores, axis=0)
# Plot the diagonal (it's exactly the same as the time-by-time decoding above)
fig, ax = plt.subplots()
ax.plot(epochs.times, np.diag(scores), label='score')
ax.axhline(.5, color='k', linestyle='--', label='chance')
ax.set_xlabel('Times')
ax.set_ylabel('AUC')
ax.legend()
ax.axvline(.0, color='k', linestyle='-')
ax.set_title('Decoding MEG sensors over time')
```

```
[Parallel(n_jobs=1)]: Using backend SequentialBackend with 1 concurrent workers.
0%| | Fitting GeneralizingEstimator : 0/36 [00:00<?, ?it/s]
14%|#3 | Fitting GeneralizingEstimator : 5/36 [00:00<00:00, 145.42it/s]
31%|### | Fitting GeneralizingEstimator : 11/36 [00:00<00:00, 161.60it/s]
50%|##### | Fitting GeneralizingEstimator : 18/36 [00:00<00:00, 177.34it/s]
69%|######9 | Fitting GeneralizingEstimator : 25/36 [00:00<00:00, 185.32it/s]
83%|########3 | Fitting GeneralizingEstimator : 30/36 [00:00<00:00, 177.13it/s]
97%|#########7| Fitting GeneralizingEstimator : 35/36 [00:00<00:00, 171.65it/s]
100%|##########| Fitting GeneralizingEstimator : 36/36 [00:00<00:00, 176.16it/s]
0%| | Scoring GeneralizingEstimator : 0/1296 [00:00<?, ?it/s]
2%|1 | Scoring GeneralizingEstimator : 24/1296 [00:00<00:01, 706.52it/s]
4%|4 | Scoring GeneralizingEstimator : 54/1296 [00:00<00:01, 793.77it/s]
7%|6 | Scoring GeneralizingEstimator : 86/1296 [00:00<00:01, 846.92it/s]
9%|8 | Scoring GeneralizingEstimator : 115/1296 [00:00<00:01, 846.66it/s]
11%|#1 | Scoring GeneralizingEstimator : 148/1296 [00:00<00:01, 874.43it/s]
14%|#4 | Scoring GeneralizingEstimator : 182/1296 [00:00<00:01, 898.44it/s]
17%|#6 | Scoring GeneralizingEstimator : 215/1296 [00:00<00:01, 910.88it/s]
19%|#9 | Scoring GeneralizingEstimator : 247/1296 [00:00<00:01, 913.52it/s]
22%|##1 | Scoring GeneralizingEstimator : 281/1296 [00:00<00:01, 926.06it/s]
24%|##4 | Scoring GeneralizingEstimator : 314/1296 [00:00<00:01, 930.22it/s]
27%|##6 | Scoring GeneralizingEstimator : 347/1296 [00:00<00:01, 935.70it/s]
29%|##9 | Scoring GeneralizingEstimator : 381/1296 [00:00<00:00, 942.17it/s]
32%|###1 | Scoring GeneralizingEstimator : 414/1296 [00:00<00:00, 944.55it/s]
35%|###4 | Scoring GeneralizingEstimator : 448/1296 [00:00<00:00, 948.58it/s]
37%|###7 | Scoring GeneralizingEstimator : 482/1296 [00:00<00:00, 953.76it/s]
40%|###9 | Scoring GeneralizingEstimator : 514/1296 [00:00<00:00, 953.30it/s]
42%|####2 | Scoring GeneralizingEstimator : 547/1296 [00:00<00:00, 954.91it/s]
45%|####4 | Scoring GeneralizingEstimator : 580/1296 [00:00<00:00, 956.75it/s]
47%|####7 | Scoring GeneralizingEstimator : 613/1296 [00:00<00:00, 958.09it/s]
50%|####9 | Scoring GeneralizingEstimator : 645/1296 [00:00<00:00, 956.93it/s]
52%|#####2 | Scoring GeneralizingEstimator : 676/1296 [00:00<00:00, 953.75it/s]
55%|#####4 | Scoring GeneralizingEstimator : 708/1296 [00:00<00:00, 953.03it/s]
57%|#####7 | Scoring GeneralizingEstimator : 740/1296 [00:00<00:00, 952.01it/s]
59%|#####9 | Scoring GeneralizingEstimator : 771/1296 [00:00<00:00, 949.23it/s]
62%|######2 | Scoring GeneralizingEstimator : 804/1296 [00:00<00:00, 949.64it/s]
65%|######4 | Scoring GeneralizingEstimator : 836/1296 [00:00<00:00, 948.66it/s]
67%|######6 | Scoring GeneralizingEstimator : 867/1296 [00:00<00:00, 945.99it/s]
69%|######9 | Scoring GeneralizingEstimator : 899/1296 [00:00<00:00, 945.73it/s]
72%|#######1 | Scoring GeneralizingEstimator : 932/1296 [00:00<00:00, 947.72it/s]
74%|#######4 | Scoring GeneralizingEstimator : 962/1296 [00:01<00:00, 942.99it/s]
77%|#######6 | Scoring GeneralizingEstimator : 995/1296 [00:01<00:00, 944.91it/s]
79%|#######9 | Scoring GeneralizingEstimator : 1028/1296 [00:01<00:00, 946.75it/s]
82%|########1 | Scoring GeneralizingEstimator : 1061/1296 [00:01<00:00, 948.14it/s]
84%|########4 | Scoring GeneralizingEstimator : 1094/1296 [00:01<00:00, 948.61it/s]
87%|########6 | Scoring GeneralizingEstimator : 1127/1296 [00:01<00:00, 950.27it/s]
90%|########9 | Scoring GeneralizingEstimator : 1161/1296 [00:01<00:00, 953.60it/s]
92%|#########2| Scoring GeneralizingEstimator : 1193/1296 [00:01<00:00, 952.90it/s]
94%|#########4| Scoring GeneralizingEstimator : 1223/1296 [00:01<00:00, 949.03it/s]
97%|#########6| Scoring GeneralizingEstimator : 1256/1296 [00:01<00:00, 950.68it/s]
99%|#########9| Scoring GeneralizingEstimator : 1289/1296 [00:01<00:00, 952.12it/s]
100%|##########| Scoring GeneralizingEstimator : 1296/1296 [00:01<00:00, 947.12it/s]
[Parallel(n_jobs=1)]: Done 1 out of 1 | elapsed: 1.6s remaining: 0.0s
0%| | Fitting GeneralizingEstimator : 0/36 [00:00<?, ?it/s]
11%|#1 | Fitting GeneralizingEstimator : 4/36 [00:00<00:00, 117.93it/s]
25%|##5 | Fitting GeneralizingEstimator : 9/36 [00:00<00:00, 133.06it/s]
39%|###8 | Fitting GeneralizingEstimator : 14/36 [00:00<00:00, 138.30it/s]
58%|#####8 | Fitting GeneralizingEstimator : 21/36 [00:00<00:00, 156.65it/s]
69%|######9 | Fitting GeneralizingEstimator : 25/36 [00:00<00:00, 148.23it/s]
83%|########3 | Fitting GeneralizingEstimator : 30/36 [00:00<00:00, 148.17it/s]
100%|##########| Fitting GeneralizingEstimator : 36/36 [00:00<00:00, 154.27it/s]
100%|##########| Fitting GeneralizingEstimator : 36/36 [00:00<00:00, 152.79it/s]
0%| | Scoring GeneralizingEstimator : 0/1296 [00:00<?, ?it/s]
2%|2 | Scoring GeneralizingEstimator : 31/1296 [00:00<00:01, 908.57it/s]
5%|4 | Scoring GeneralizingEstimator : 62/1296 [00:00<00:01, 911.09it/s]
7%|7 | Scoring GeneralizingEstimator : 92/1296 [00:00<00:01, 902.05it/s]
9%|9 | Scoring GeneralizingEstimator : 123/1296 [00:00<00:01, 906.41it/s]
11%|#1 | Scoring GeneralizingEstimator : 148/1296 [00:00<00:01, 869.86it/s]
13%|#3 | Scoring GeneralizingEstimator : 170/1296 [00:00<00:01, 828.09it/s]
15%|#5 | Scoring GeneralizingEstimator : 195/1296 [00:00<00:01, 813.66it/s]
17%|#7 | Scoring GeneralizingEstimator : 222/1296 [00:00<00:01, 811.29it/s]
19%|#9 | Scoring GeneralizingEstimator : 249/1296 [00:00<00:01, 807.67it/s]
21%|##1 | Scoring GeneralizingEstimator : 278/1296 [00:00<00:01, 811.38it/s]
24%|##3 | Scoring GeneralizingEstimator : 310/1296 [00:00<00:01, 826.77it/s]
26%|##6 | Scoring GeneralizingEstimator : 342/1296 [00:00<00:01, 839.43it/s]
29%|##8 | Scoring GeneralizingEstimator : 374/1296 [00:00<00:01, 850.30it/s]
31%|###1 | Scoring GeneralizingEstimator : 407/1296 [00:00<00:01, 860.84it/s]
34%|###3 | Scoring GeneralizingEstimator : 440/1296 [00:00<00:00, 870.46it/s]
37%|###6 | Scoring GeneralizingEstimator : 474/1296 [00:00<00:00, 882.11it/s]
39%|###9 | Scoring GeneralizingEstimator : 507/1296 [00:00<00:00, 890.01it/s]
42%|####1 | Scoring GeneralizingEstimator : 540/1296 [00:00<00:00, 896.59it/s]
44%|####4 | Scoring GeneralizingEstimator : 572/1296 [00:00<00:00, 899.44it/s]
47%|####6 | Scoring GeneralizingEstimator : 606/1296 [00:00<00:00, 907.61it/s]
49%|####8 | Scoring GeneralizingEstimator : 632/1296 [00:00<00:00, 897.15it/s]
51%|##### | Scoring GeneralizingEstimator : 656/1296 [00:00<00:00, 883.48it/s]
53%|#####3 | Scoring GeneralizingEstimator : 689/1296 [00:00<00:00, 890.10it/s]
56%|#####5 | Scoring GeneralizingEstimator : 722/1296 [00:00<00:00, 895.39it/s]
58%|#####8 | Scoring GeneralizingEstimator : 755/1296 [00:00<00:00, 900.90it/s]
61%|###### | Scoring GeneralizingEstimator : 789/1296 [00:00<00:00, 907.99it/s]
63%|######3 | Scoring GeneralizingEstimator : 822/1296 [00:00<00:00, 911.74it/s]
66%|######6 | Scoring GeneralizingEstimator : 856/1296 [00:00<00:00, 917.69it/s]
69%|######8 | Scoring GeneralizingEstimator : 889/1296 [00:00<00:00, 921.48it/s]
71%|#######1 | Scoring GeneralizingEstimator : 921/1296 [00:01<00:00, 923.15it/s]
74%|#######3 | Scoring GeneralizingEstimator : 954/1296 [00:01<00:00, 925.24it/s]
76%|#######6 | Scoring GeneralizingEstimator : 987/1296 [00:01<00:00, 928.08it/s]
79%|#######8 | Scoring GeneralizingEstimator : 1018/1296 [00:01<00:00, 927.42it/s]
81%|######## | Scoring GeneralizingEstimator : 1048/1296 [00:01<00:00, 924.87it/s]
83%|########2 | Scoring GeneralizingEstimator : 1073/1296 [00:01<00:00, 913.57it/s]
85%|########4 | Scoring GeneralizingEstimator : 1096/1296 [00:01<00:00, 899.25it/s]
86%|########6 | Scoring GeneralizingEstimator : 1121/1296 [00:01<00:00, 889.98it/s]
88%|########8 | Scoring GeneralizingEstimator : 1146/1296 [00:01<00:00, 881.33it/s]
91%|######### | Scoring GeneralizingEstimator : 1177/1296 [00:01<00:00, 883.47it/s]
93%|#########3| Scoring GeneralizingEstimator : 1209/1296 [00:01<00:00, 886.90it/s]
96%|#########5| Scoring GeneralizingEstimator : 1242/1296 [00:01<00:00, 891.93it/s]
98%|#########8| Scoring GeneralizingEstimator : 1276/1296 [00:01<00:00, 898.23it/s]
100%|##########| Scoring GeneralizingEstimator : 1296/1296 [00:01<00:00, 899.23it/s]
100%|##########| Scoring GeneralizingEstimator : 1296/1296 [00:01<00:00, 894.61it/s]
[Parallel(n_jobs=1)]: Done 2 out of 2 | elapsed: 3.4s remaining: 0.0s
0%| | Fitting GeneralizingEstimator : 0/36 [00:00<?, ?it/s]
14%|#3 | Fitting GeneralizingEstimator : 5/36 [00:00<00:00, 147.62it/s]
31%|### | Fitting GeneralizingEstimator : 11/36 [00:00<00:00, 162.98it/s]
53%|#####2 | Fitting GeneralizingEstimator : 19/36 [00:00<00:00, 188.17it/s]
72%|#######2 | Fitting GeneralizingEstimator : 26/36 [00:00<00:00, 193.29it/s]
89%|########8 | Fitting GeneralizingEstimator : 32/36 [00:00<00:00, 189.70it/s]
100%|##########| Fitting GeneralizingEstimator : 36/36 [00:00<00:00, 188.51it/s]
100%|##########| Fitting GeneralizingEstimator : 36/36 [00:00<00:00, 187.56it/s]
0%| | Scoring GeneralizingEstimator : 0/1296 [00:00<?, ?it/s]
2%|2 | Scoring GeneralizingEstimator : 31/1296 [00:00<00:01, 914.89it/s]
5%|4 | Scoring GeneralizingEstimator : 64/1296 [00:00<00:01, 939.55it/s]
8%|7 | Scoring GeneralizingEstimator : 98/1296 [00:00<00:01, 962.04it/s]
10%|# | Scoring GeneralizingEstimator : 130/1296 [00:00<00:01, 958.06it/s]
13%|#2 | Scoring GeneralizingEstimator : 164/1296 [00:00<00:01, 967.53it/s]
15%|#5 | Scoring GeneralizingEstimator : 197/1296 [00:00<00:01, 968.20it/s]
18%|#7 | Scoring GeneralizingEstimator : 230/1296 [00:00<00:01, 969.12it/s]
20%|## | Scoring GeneralizingEstimator : 263/1296 [00:00<00:01, 968.41it/s]
23%|##2 | Scoring GeneralizingEstimator : 297/1296 [00:00<00:01, 973.33it/s]
25%|##5 | Scoring GeneralizingEstimator : 330/1296 [00:00<00:00, 973.89it/s]
28%|##8 | Scoring GeneralizingEstimator : 363/1296 [00:00<00:00, 973.39it/s]
30%|### | Scoring GeneralizingEstimator : 395/1296 [00:00<00:00, 970.54it/s]
33%|###3 | Scoring GeneralizingEstimator : 428/1296 [00:00<00:00, 971.00it/s]
36%|###5 | Scoring GeneralizingEstimator : 462/1296 [00:00<00:00, 974.29it/s]
38%|###7 | Scoring GeneralizingEstimator : 492/1296 [00:00<00:00, 966.25it/s]
40%|#### | Scoring GeneralizingEstimator : 524/1296 [00:00<00:00, 964.49it/s]
43%|####2 | Scoring GeneralizingEstimator : 557/1296 [00:00<00:00, 964.56it/s]
46%|####5 | Scoring GeneralizingEstimator : 590/1296 [00:00<00:00, 965.32it/s]
48%|####7 | Scoring GeneralizingEstimator : 622/1296 [00:00<00:00, 963.71it/s]
50%|##### | Scoring GeneralizingEstimator : 654/1296 [00:00<00:00, 962.23it/s]
53%|#####3 | Scoring GeneralizingEstimator : 687/1296 [00:00<00:00, 962.54it/s]
55%|#####5 | Scoring GeneralizingEstimator : 718/1296 [00:00<00:00, 959.25it/s]
58%|#####7 | Scoring GeneralizingEstimator : 751/1296 [00:00<00:00, 959.49it/s]
61%|###### | Scoring GeneralizingEstimator : 785/1296 [00:00<00:00, 962.84it/s]
63%|######3 | Scoring GeneralizingEstimator : 817/1296 [00:00<00:00, 961.75it/s]
66%|######5 | Scoring GeneralizingEstimator : 850/1296 [00:00<00:00, 961.38it/s]
68%|######8 | Scoring GeneralizingEstimator : 883/1296 [00:00<00:00, 962.04it/s]
71%|####### | Scoring GeneralizingEstimator : 916/1296 [00:00<00:00, 962.58it/s]
73%|#######3 | Scoring GeneralizingEstimator : 950/1296 [00:00<00:00, 965.33it/s]
76%|#######5 | Scoring GeneralizingEstimator : 983/1296 [00:01<00:00, 965.90it/s]
78%|#######8 | Scoring GeneralizingEstimator : 1016/1296 [00:01<00:00, 966.65it/s]
81%|######## | Scoring GeneralizingEstimator : 1049/1296 [00:01<00:00, 967.33it/s]
83%|########3 | Scoring GeneralizingEstimator : 1082/1296 [00:01<00:00, 967.85it/s]
86%|########5 | Scoring GeneralizingEstimator : 1114/1296 [00:01<00:00, 966.55it/s]
89%|########8 | Scoring GeneralizingEstimator : 1147/1296 [00:01<00:00, 966.96it/s]
91%|#########1| Scoring GeneralizingEstimator : 1181/1296 [00:01<00:00, 969.36it/s]
94%|#########3| Scoring GeneralizingEstimator : 1214/1296 [00:01<00:00, 969.57it/s]
96%|#########6| Scoring GeneralizingEstimator : 1247/1296 [00:01<00:00, 969.97it/s]
99%|#########8| Scoring GeneralizingEstimator : 1280/1296 [00:01<00:00, 970.44it/s]
100%|##########| Scoring GeneralizingEstimator : 1296/1296 [00:01<00:00, 969.91it/s]
100%|##########| Scoring GeneralizingEstimator : 1296/1296 [00:01<00:00, 967.33it/s]
[Parallel(n_jobs=1)]: Done 3 out of 3 | elapsed: 4.9s remaining: 0.0s
[Parallel(n_jobs=1)]: Done 3 out of 3 | elapsed: 4.9s finished
```

Plot the full (generalization) matrix:

```
fig, ax = plt.subplots(1, 1)
im = ax.imshow(scores, interpolation='lanczos', origin='lower', cmap='RdBu_r',
extent=epochs.times[[0, -1, 0, -1]], vmin=0., vmax=1.)
ax.set_xlabel('Testing Time (s)')
ax.set_ylabel('Training Time (s)')
ax.set_title('Temporal generalization')
ax.axvline(0, color='k')
ax.axhline(0, color='k')
cbar = plt.colorbar(im, ax=ax)
cbar.set_label('AUC')
```

## Projecting sensor-space patterns to source space#

If you use a linear classifier (or regressor) for your data, you can also
project these to source space. For example, using our `evoked_time_gen`

from before:

```
cov = mne.compute_covariance(epochs, tmax=0.)
del epochs
fwd = mne.read_forward_solution(
meg_path / 'sample_audvis-meg-eeg-oct-6-fwd.fif')
inv = mne.minimum_norm.make_inverse_operator(
evoked_time_gen.info, fwd, cov, loose=0.)
stc = mne.minimum_norm.apply_inverse(evoked_time_gen, inv, 1. / 9., 'dSPM')
del fwd, inv
```

```
Computing rank from data with rank=None
Using tolerance 3.1e-10 (2.2e-16 eps * 203 dim * 7e+03 max singular value)
Estimated rank (grad): 203
GRAD: rank 203 computed from 203 data channels with 0 projectors
Reducing data rank from 203 -> 203
Estimating covariance using EMPIRICAL
Done.
Number of samples used : 1353
[done]
Reading forward solution from /home/circleci/mne_data/MNE-sample-data/MEG/sample/sample_audvis-meg-eeg-oct-6-fwd.fif...
Reading a source space...
Computing patch statistics...
Patch information added...
Distance information added...
[done]
Reading a source space...
Computing patch statistics...
Patch information added...
Distance information added...
[done]
2 source spaces read
Desired named matrix (kind = 3523) not available
Read MEG forward solution (7498 sources, 306 channels, free orientations)
Desired named matrix (kind = 3523) not available
Read EEG forward solution (7498 sources, 60 channels, free orientations)
MEG and EEG forward solutions combined
Source spaces transformed to the forward solution coordinate frame
Computing inverse operator with 203 channels.
203 out of 366 channels remain after picking
Selected 203 channels
Creating the depth weighting matrix...
203 planar channels
limit = 7262/7498 = 10.020866
scale = 2.58122e-08 exp = 0.8
Picked elements from a free-orientation depth-weighting prior into the fixed-orientation one
Average patch normals will be employed in the rotation to the local surface coordinates....
Converting to surface-based source orientations...
[done]
Whitening the forward solution.
Computing rank from covariance with rank=None
Using tolerance 1.6e-13 (2.2e-16 eps * 203 dim * 3.6 max singular value)
Estimated rank (grad): 203
GRAD: rank 203 computed from 203 data channels with 0 projectors
Setting small GRAD eigenvalues to zero (without PCA)
Creating the source covariance matrix
Adjusting source covariance matrix.
Computing SVD of whitened and weighted lead field matrix.
largest singular value = 3.91709
scaling factor to adjust the trace = 6.26373e+18 (nchan = 203 nzero = 0)
Preparing the inverse operator for use...
Scaled noise and source covariance from nave = 1 to nave = 1
Created the regularized inverter
The projection vectors do not apply to these channels.
Created the whitener using a noise covariance matrix with rank 203 (0 small eigenvalues omitted)
Computing noise-normalization factors (dSPM)...
[done]
Applying inverse operator to ""...
Picked 203 channels from the data
Computing inverse...
Eigenleads need to be weighted ...
Computing residual...
Explained 76.4% variance
dSPM...
[done]
```

And this can be visualized using `stc.plot`

:

```
Using control points [1.98776221 2.41838256 8.06628582]
```

## Source-space decoding#

Source space decoding is also possible, but because the number of features can be much larger than in the sensor space, univariate feature selection using ANOVA f-test (or some other metric) can be done to reduce the feature dimension. Interpreting decoding results might be easier in source space as compared to sensor space.

Examples

## Exercise#

Explore other datasets from MNE (e.g. Face dataset from SPM to predict Face vs. Scrambled)

## References#

- 1
Jean-Rémi King, Laura Gwilliams, Chris Holdgraf, Jona Sassenhagen, Alexandre Barachant, Denis Engemann, Eric Larson, and Alexandre Gramfort. Encoding and decoding neuronal dynamics: methodological framework to uncover the algorithms of cognition. hal-01848442, 2018. URL: https://hal.archives-ouvertes.fr/hal-01848442.

- 2
Zoltan J. Koles. The quantitative extraction and topographic mapping of the abnormal components in the clinical EEG.

*Electroencephalography and Clinical Neurophysiology*, 79(6):440–447, 1991. doi:10.1016/0013-4694(91)90163-X.- 3
Sven Dähne, Frank C. Meinecke, Stefan Haufe, Johannes Höhne, Michael Tangermann, Klaus-Robert Müller, and Vadim V. Nikulin. SPoC: a novel framework for relating the amplitude of neuronal oscillations to behaviorally relevant parameters.

*NeuroImage*, 86:111–122, 2014. doi:10.1016/j.neuroimage.2013.07.079.- 4
Bertrand Rivet, Antoine Souloumiac, Virginie Attina, and Guillaume Gibert. xDAWN algorithm to enhance evoked potentials: application to brain–computer interface.

*IEEE Transactions on Biomedical Engineering*, 56(8):2035–2043, 2009. doi:10.1109/TBME.2009.2012869.- 5
Aaron Schurger, Sebastien Marti, and Stanislas Dehaene. Reducing multi-sensor data to a single time course that reveals experimental effects.

*BMC Neuroscience*, 2013. doi:10.1186/1471-2202-14-122.- 6
Jean-Rémi King, Alexandre Gramfort, Aaron Schurger, Lionel Naccache, and Stanislas Dehaene. Two distinct dynamic modes subtend the detection of unexpected sounds.

*PLoS ONE*, 9(1):e85791, 2014. doi:10.1371/journal.pone.0085791.- 7
Jean-Rémi King and Stanislas Dehaene. Characterizing the dynamics of mental representations: the temporal generalization method.

*Trends in Cognitive Sciences*, 18(4):203–210, 2014. doi:10.1016/j.tics.2014.01.002.

**Total running time of the script:** ( 0 minutes 26.919 seconds)

**Estimated memory usage:** 115 MB