An object for detecting outliers in a Gaussian distributed dataset.
Read more in the User Guide.
Specify if the estimated precision is stored.
If True, the support of robust location and covariance estimates is computed, and a covariance estimate is recomputed from it, without centering the data. Useful to work with data whose mean is significantly equal to zero but is not exactly zero. If False, the robust location and covariance are directly computed with the FastMCD algorithm without additional treatment.
The proportion of points to be included in the support of the raw MCD estimate. If None, the minimum value of support_fraction will be used within the algorithm: (n_samples + n_features + 1) / 2 * n_samples
. Range is (0, 1).
The amount of contamination of the data set, i.e. the proportion of outliers in the data set. Range is (0, 0.5].
Determines the pseudo random number generator for shuffling the data. Pass an int for reproducible results across multiple function calls. See Glossary.
Estimated robust location.
Estimated robust covariance matrix.
Estimated pseudo inverse matrix. (stored only if store_precision is True)
A mask of the observations that have been used to compute the robust estimates of location and shape.
Offset used to define the decision function from the raw scores. We have the relation: decision_function = score_samples - offset_
. The offset depends on the contamination parameter and is defined in such a way we obtain the expected number of outliers (samples with decision function < 0) in training.
Added in version 0.20.
The raw robust estimated location before correction and re-weighting.
The raw robust estimated covariance before correction and re-weighting.
A mask of the observations that have been used to compute the raw robust estimates of location and shape, before correction and re-weighting.
Mahalanobis distances of the training set (on which fit
is called) observations.
Number of features seen during fit.
Added in version 0.24.
n_features_in_
,)
Names of features seen during fit. Defined only when X
has feature names that are all strings.
Added in version 1.0.
See also
EmpiricalCovariance
Maximum likelihood covariance estimator.
GraphicalLasso
Sparse inverse covariance estimation with an l1-penalized estimator.
LedoitWolf
LedoitWolf Estimator.
MinCovDet
Minimum Covariance Determinant (robust estimator of covariance).
OAS
Oracle Approximating Shrinkage Estimator.
ShrunkCovariance
Covariance estimator with shrinkage.
Notes
Outlier detection from covariance estimation may break or not perform well in high-dimensional settings. In particular, one will always take care to work with n_samples > n_features ** 2
.
References
[1]Rousseeuw, P.J., Van Driessen, K. “A fast algorithm for the minimum covariance determinant estimator” Technometrics 41(3), 212 (1999)
Examples
>>> import numpy as np >>> from sklearn.covariance import EllipticEnvelope >>> true_cov = np.array([[.8, .3], ... [.3, .4]]) >>> X = np.random.RandomState(0).multivariate_normal(mean=[0, 0], ... cov=true_cov, ... size=500) >>> cov = EllipticEnvelope(random_state=0).fit(X) >>> # predict returns 1 for an inlier and -1 for an outlier >>> cov.predict([[0, 0], ... [3, 3]]) array([ 1, -1]) >>> cov.covariance_ array([[0.7411, 0.2535], [0.2535, 0.3053]]) >>> cov.location_ array([0.0813 , 0.0427])
Apply a correction to raw Minimum Covariance Determinant estimates.
Correction using the empirical correction factor suggested by Rousseeuw and Van Driessen in [RVD].
The data matrix, with p features and n samples. The data set must be the one which was used to compute the raw estimates.
Corrected robust covariance estimate.
References
[RVD]A Fast Algorithm for the Minimum Covariance Determinant Estimator, 1999, American Statistical Association and the American Society for Quality, TECHNOMETRICS
Compute the decision function of the given observations.
The data matrix.
Decision function of the samples. It is equal to the shifted Mahalanobis distances. The threshold for being an outlier is 0, which ensures a compatibility with other outlier detection algorithms.
Compute the Mean Squared Error between two covariance estimators.
The covariance to compare with.
The type of norm used to compute the error. Available error types: - ‘frobenius’ (default): sqrt(tr(A^t.A)) - ‘spectral’: sqrt(max(eigenvalues(A^t.A)) where A is the error (comp_cov - self.covariance_)
.
If True (default), the squared error norm is divided by n_features. If False, the squared error norm is not rescaled.
Whether to compute the squared error norm or the error norm. If True (default), the squared error norm is returned. If False, the error norm is returned.
The Mean Squared Error (in the sense of the Frobenius norm) between self
and comp_cov
covariance estimators.
Fit the EllipticEnvelope model.
Training data.
Not used, present for API consistency by convention.
Returns the instance itself.
Perform fit on X and returns labels for X.
Returns -1 for outliers and 1 for inliers.
The input samples.
Not used, present for API consistency by convention.
Arguments to be passed to fit
.
Added in version 1.4.
1 for inliers, -1 for outliers.
Get metadata routing of this object.
Please check User Guide on how the routing mechanism works.
A MetadataRequest
encapsulating routing information.
Get parameters for this estimator.
If True, will return the parameters for this estimator and contained subobjects that are estimators.
Parameter names mapped to their values.
Getter for the precision matrix.
The precision matrix associated to the current covariance object.
Compute the squared Mahalanobis distances of given observations.
For a detailed example of how outliers affects the Mahalanobis distance, see Robust covariance estimation and Mahalanobis distances relevance.
The observations, the Mahalanobis distances of the which we compute. Observations are assumed to be drawn from the same distribution than the data used in fit.
Squared Mahalanobis distances of the observations.
Predict labels (1 inlier, -1 outlier) of X according to fitted model.
The data matrix.
Returns -1 for anomalies/outliers and +1 for inliers.
Re-weight raw Minimum Covariance Determinant estimates.
Re-weight observations using Rousseeuw’s method (equivalent to deleting outlying observations from the data set before computing location and covariance estimates) described in [RVDriessen].
The data matrix, with p features and n samples. The data set must be the one which was used to compute the raw estimates.
Re-weighted robust location estimate.
Re-weighted robust covariance estimate.
A mask of the observations that have been used to compute the re-weighted robust location and covariance estimates.
References
[RVDriessen]A Fast Algorithm for the Minimum Covariance Determinant Estimator, 1999, American Statistical Association and the American Society for Quality, TECHNOMETRICS
Return the mean accuracy on the given test data and labels.
In multi-label classification, this is the subset accuracy which is a harsh metric since you require for each sample that each label set be correctly predicted.
Test samples.
True labels for X.
Sample weights.
Mean accuracy of self.predict(X) w.r.t. y.
Compute the negative Mahalanobis distances.
The data matrix.
Opposite of the Mahalanobis distances.
Set the parameters of this estimator.
The method works on simple estimators as well as on nested objects (such as Pipeline
). The latter have parameters of the form <component>__<parameter>
so that it’s possible to update each component of a nested object.
Estimator parameters.
Estimator instance.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4