MCPcopy
hub / github.com/mne-tools/mne-python / predict_proba

Method predict_proba

mne/decoding/search_light.py:244–264  ·  view source on GitHub ↗

Predict each data slice with a series of independent estimators. The number of tasks in X should match the number of tasks/estimators given at fit time. Parameters ---------- X : array, shape (n_samples, nd_features, n_tasks) The input samples. F

(self, X)

Source from the content-addressed store, hash-verified

242 return self._transform(X, "predict")
243
244 def predict_proba(self, X):
245 """Predict each data slice with a series of independent estimators.
246
247 The number of tasks in X should match the number of tasks/estimators
248 given at fit time.
249
250 Parameters
251 ----------
252 X : array, shape (n_samples, nd_features, n_tasks)
253 The input samples. For each data slice, the corresponding estimator
254 makes the sample probabilistic predictions, e.g.:
255 ``[estimators[ii].predict_proba(X[..., ii]) for ii in range(n_estimators)]``.
256 The feature dimension can be multidimensional e.g.
257 X.shape = (n_samples, n_features_1, n_features_2, n_tasks).
258
259 Returns
260 -------
261 y_pred : array, shape (n_samples, n_tasks, n_classes)
262 Predicted probabilities for each estimator/data slice/task.
263 """ # noqa: E501
264 return self._transform(X, "predict_proba")
265
266 def decision_function(self, X):
267 """Estimate distances of each data slice to the hyperplanes.

Callers 2

test_search_light_basicFunction · 0.95

Calls 1

_transformMethod · 0.95

Tested by 1

test_search_light_basicFunction · 0.76