manifold.SpectralEmbedding()

class sklearn.manifold.SpectralEmbedding(n_components=2, affinity='nearest_neighbors', gamma=None, random_state=None, eigen_solver=None, n_neighbors=None, n_jobs=1) [source]

Spectral embedding for non-linear dimensionality reduction.

Forms an affinity matrix given by the specified function and applies spectral decomposition to the corresponding graph laplacian. The resulting transformation is given by the value of the eigenvectors for each data point.

Parameters:	n_components : integer, default: 2 The dimension of the projected subspace. eigen_solver : {None, ?arpack?, ?lobpcg?, or ?amg?} The eigenvalue decomposition strategy to use. AMG requires pyamg to be installed. It can be faster on very large, sparse problems, but may also lead to instabilities. random_state : int seed, RandomState instance, or None, default A pseudo random number generator used for the initialization of the lobpcg eigenvectors decomposition when eigen_solver == ?amg?. affinity : string or callable, default How to construct the affinity matrix. ?nearest_neighbors? : construct affinity matrix by knn graph ?rbf? : construct affinity matrix by rbf kernel ?precomputed? : interpret X as precomputed affinity matrix callable : use passed in function as affinity the function takes in data matrix (n_samples, n_features) and return affinity matrix (n_samples, n_samples). gamma : float, optional, default Kernel coefficient for rbf kernel. n_neighbors : int, default Number of nearest neighbors for nearest_neighbors graph building. n_jobs : int, optional (default = 1) The number of parallel jobs to run. If `-1`, then the number of jobs is set to the number of CPU cores.
Attributes:	embedding_ : array, shape = (n_samples, n_components) Spectral embedding of the training matrix. affinity_matrix_ : array, shape = (n_samples, n_samples) Affinity_matrix constructed from samples or precomputed.

References

A Tutorial on Spectral Clustering, 2007 Ulrike von Luxburg http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.9323
On Spectral Clustering: Analysis and an algorithm, 2011 Andrew Y. Ng, Michael I. Jordan, Yair Weiss http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.8100
Normalized cuts and image segmentation, 2000 Jianbo Shi, Jitendra Malik http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.2324

Methods

`fit`(X[, y])	Fit the model from data in X.
`fit_transform`(X[, y])	Fit the model from data in X and transform X.
`get_params`([deep])	Get parameters for this estimator.
`set_params`(\\params)	Set the parameters of this estimator.

__init__(n_components=2, affinity='nearest_neighbors', gamma=None, random_state=None, eigen_solver=None, n_neighbors=None, n_jobs=1) [source]

fit(X, y=None) [source]

Fit the model from data in X.

Parameters:

Parameters:	X : array-like, shape (n_samples, n_features) Training vector, where n_samples is the number of samples and n_features is the number of features. If affinity is ?precomputed? X : array-like, shape (n_samples, n_samples), Interpret X as precomputed adjacency graph computed from samples.
Returns:	self : object Returns the instance itself.

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

Training vector, where n_samples is the number of samples and n_features is the number of features.

If affinity is ?precomputed? X : array-like, shape (n_samples, n_samples), Interpret X as precomputed adjacency graph computed from samples.

Returns:

self : object

Returns the instance itself.

fit_transform(X, y=None) [source]

Fit the model from data in X and transform X.

Parameters:

Parameters:	X: array-like, shape (n_samples, n_features) : Training vector, where n_samples is the number of samples and n_features is the number of features. If affinity is ?precomputed? X : array-like, shape (n_samples, n_samples), Interpret X as precomputed adjacency graph computed from samples.
Returns:	X_new: array-like, shape (n_samples, n_components) :

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

Training vector, where n_samples is the number of samples and n_features is the number of features.

If affinity is ?precomputed? X : array-like, shape (n_samples, n_samples), Interpret X as precomputed adjacency graph computed from samples.

Returns:

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

get_params(deep=True) [source]

Get parameters for this estimator.

Parameters:

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.

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.

set_params(**params) [source]

Set the parameters of this estimator.

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