sklearn.decomposition.TruncatedSVD

class sklearn.decomposition.TruncatedSVD(n_components=2, algorithm='randomized', n_iter=5, random_state=None, tol=0.0, n_iterations=None)

Dimensionality reduction using truncated SVD (aka LSA).

This transformer performs linear dimensionality reduction by means of truncated singular value decomposition (SVD). It is very similar to PCA, but operates on sample vectors directly, instead of on a covariance matrix. This means it can work with scipy.sparse matrices efficiently.

In particular, truncated SVD works on term count/tf-idf matrices as returned by the vectorizers in sklearn.feature_extraction.text. In that context, it is known as latent semantic analysis (LSA).

This estimator supports two algorithm: a fast randomized SVD solver, and a “naive” algorithm that uses ARPACK as an eigensolver on (X * X.T) or (X.T * X), whichever is more efficient.

Parameters :

n_components : int, default = 2

Desired dimensionality of output data. Must be strictly less than the number of features. The default value is useful for visualisation. For LSA, a value of 100 is recommended.

algorithm : string, default = “randomized”

SVD solver to use. Either “arpack” for the ARPACK wrapper in SciPy (scipy.sparse.linalg.svds), or “randomized” for the randomized algorithm due to Halko (2009).

n_iter : int, optional

Number of iterations for randomized SVD solver. Not used by ARPACK.

random_state : int or RandomState, optional

(Seed for) pseudo-random number generator. If not given, the numpy.random singleton is used.

tol : float, optional

Tolerance for ARPACK. 0 means machine precision. Ignored by randomized SVD solver.

See also

PCA, RandomizedPCA

Notes

SVD suffers from a problem called “sign indeterminancy”, which means the sign of the components_ and the output from transform depend on the algorithm and random state. To work around this, fit instances of this class to data once, then keep the instance around to do transformations.

References

Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions Halko, et al., 2009 (arXiv:909) http://arxiv.org/pdf/0909.4061

Attributes

components_

array, shape (n_components, n_features)

Methods

fit(X[, y])	Fit LSI model on training data X.
fit_transform(X[, y])	Fit LSI model to X and perform dimensionality reduction on X.
get_params([deep])	Get parameters for this estimator.
inverse_transform(X)	Transform X back to its original space.
set_params(**params)	Set the parameters of this estimator.
transform(X)	Perform dimensionality reduction on X.

__init__(n_components=2, algorithm='randomized', n_iter=5, random_state=None, tol=0.0, n_iterations=None)

fit(X, y=None)

Fit LSI model on training data X.

Parameters :

X : {array-like, sparse matrix}, shape (n_samples, n_features)

Training data.

Returns :

self : object

Returns the transformer object.

fit_transform(X, y=None)

Fit LSI model to X and perform dimensionality reduction on X.

Parameters :

X : {array-like, sparse matrix}, shape (n_samples, n_features)

Training data.

Returns :

X_new : array, shape (n_samples, n_components)

Reduced version of X. This will always be a dense array.

get_params(deep=True)

Get parameters for this estimator.

Parameters :

deep: boolean, optional :

If True, will return the parameters for this estimator and contained subobjects that are estimators.

Returns :

params : mapping of string to any

Parameter names mapped to their values.

inverse_transform(X)

Transform X back to its original space.

Returns an array X_original whose transform would be X.

Parameters :

X : array-like, shape (n_samples, n_components)

New data.

Returns :

X_original : array, shape (n_samples, n_features)

Note that this is always a dense array.

set_params(**params)

Set the parameters of this estimator.

The method works on simple estimators as well as on nested objects (such as pipelines). The former have parameters of the form <component>__<parameter> so that it’s possible to update each component of a nested object.

Returns :self :

transform(X)

Perform dimensionality reduction on X.

Parameters :

X : {array-like, sparse matrix}, shape (n_samples, n_features)

New data.

Returns :

X_new : array, shape (n_samples, n_components)

Reduced version of X. This will always be a dense array.