Embedding¶
Decomposition¶

graspologic.embed.
select_dimension
(X, n_components=None, n_elbows=2, threshold=None, return_likelihoods=False)[source]¶ Generates profile likelihood from array based on Zhu and Godsie method. Elbows correspond to the optimal embedding dimension.
Parameters: X : 1d or 2d arraylike
Input array generate profile likelihoods for. If 1darray, it should be sorted in decreasing order. If 2darray, shape should be (n_samples, n_features).
n_components : int, optional, default: None.
Number of components to embed. If None,
n_components = floor(log2(min(n_samples, n_features)))
. Ignored if X is 1darray.n_elbows : int, optional, default: 2.
Number of likelihood elbows to return. Must be > 1.
threshold : float, int, optional, default: None
If given, only consider the singular values that are > threshold. Must be >= 0.
return_likelihoods : bool, optional, default: False
If True, returns the all likelihoods associated with each elbow.
Returns: elbows : list
Elbows indicate subsequent optimal embedding dimensions. Number of elbows may be less than n_elbows if there are not enough singular values.
sing_vals : list
The singular values associated with each elbow.
likelihoods : list of arraylike
Array of likelihoods of the corresponding to each elbow. Only returned if return_likelihoods is True.
References
[1] Zhu, M. and Ghodsi, A. (2006). Automatic dimensionality selection from the scree plot via the use of profile likelihood. Computational Statistics & Data Analysis, 51(2), pp.918930.

graspologic.embed.
selectSVD
(X, n_components=None, n_elbows=2, algorithm='randomized', n_iter=5)[source]¶ Dimensionality reduction using SVD.
Performs linear dimensionality reduction by using either full singular value decomposition (SVD) or truncated SVD. Full SVD is performed using SciPy's wrapper for ARPACK, while truncated SVD is performed using either SciPy's wrapper for LAPACK or Sklearn's implementation of randomized SVD.
It also performs optimal dimensionality selectiong using Zhu & Godsie algorithm if number of target dimension is not specified.
Parameters: X : arraylike, shape (n_samples, n_features)
The data to perform svd on.
n_components : int or None, default = None
Desired dimensionality of output data. If "full", n_components must be <= min(X.shape). Otherwise, n_components must be < min(X.shape). If None, then optimal dimensions will be chosen by
select_dimension()
usingn_elbows
argument.n_elbows : int, optional, default: 2
If
n_components=None
, then compute the optimal embedding dimension usingselect_dimension()
. Otherwise, ignored.algorithm : {'randomized' (default), 'full', 'truncated'}, optional
SVD solver to use:
 'randomized'
 Computes randomized svd using
sklearn.utils.extmath.randomized_svd()
 'full'
 Computes full svd using
scipy.linalg.svd()
 'truncated'
 Computes truncated svd using
scipy.sparse.linalg.svds()
n_iter : int, optional (default = 5)
Number of iterations for randomized SVD solver. Not used by 'full' or 'truncated'. The default is larger than the default in randomized_svd to handle sparse matrices that may have large slowly decaying spectrum.
Returns: U : arraylike, shape (n_samples, n_components)
Left singular vectors corresponding to singular values.
D : arraylike, shape (n_components)
Singular values in decreasing order, as a 1d array.
V : arraylike, shape (n_components, n_samples)
Right singular vectors corresponding to singular values.
References
[1] Zhu, M. and Ghodsi, A. (2006). Automatic dimensionality selection from the scree plot via the use of profile likelihood. Computational Statistics & Data Analysis, 51(2), pp.918930.
Single graph embedding¶

class
graspologic.embed.
AdjacencySpectralEmbed
(n_components=None, n_elbows=2, algorithm='randomized', n_iter=5, check_lcc=True, diag_aug=True, concat=False)[source]¶ Class for computing the adjacency spectral embedding of a graph.
The adjacency spectral embedding (ASE) is a kdimensional Euclidean representation of the graph based on its adjacency matrix. It relies on an SVD to reduce the dimensionality to the specified k, or if k is unspecified, can find a number of dimensions automatically (see
selectSVD
).Read more in the tutorials
Parameters: n_components : int or None, default = None
Desired dimensionality of output data. If "full", n_components must be <= min(X.shape). Otherwise, n_components must be < min(X.shape). If None, then optimal dimensions will be chosen by
select_dimension()
usingn_elbows
argument.n_elbows : int, optional, default: 2
If
n_components=None
, then compute the optimal embedding dimension usingselect_dimension()
. Otherwise, ignored.algorithm : {'randomized' (default), 'full', 'truncated'}, optional
SVD solver to use:
 'randomized'
 Computes randomized svd using
sklearn.utils.extmath.randomized_svd()
 'full'
 Computes full svd using
scipy.linalg.svd()
 'truncated'
 Computes truncated svd using
scipy.sparse.linalg.svds()
n_iter : int, optional (default = 5)
Number of iterations for randomized SVD solver. Not used by 'full' or 'truncated'. The default is larger than the default in randomized_svd to handle sparse matrices that may have large slowly decaying spectrum.
check_lcc : bool , optional (default = True)
Whether to check if input graph is connected. May result in nonoptimal results if the graph is unconnected. If True and input is unconnected, a UserWarning is thrown. Not checking for connectedness may result in faster computation.
diag_aug : bool, optional (default = True)
Whether to replace the main diagonal of the adjacency matrix with a vector corresponding to the degree (or sum of edge weights for a weighted network) before embedding. Empirically, this produces latent position estimates closer to the ground truth.
concat : bool, optional (default False)
If graph is directed, whether to concatenate left and right (out and in) latent positions along axis 1.
Attributes: n_features_in_: int
Number of features passed to the fit method.
latent_left_ : array, shape (n_samples, n_components)
Estimated left latent positions of the graph.
latent_right_ : array, shape (n_samples, n_components), or None
Only computed when the graph is directed, or adjacency matrix is assymetric. Estimated right latent positions of the graph. Otherwise, None.
singular_values_ : array, shape (n_components)
Singular values associated with the latent position matrices.
Notes
The singular value decomposition:
\[A = U \Sigma V^T\]is used to find an orthonormal basis for a matrix, which in our case is the adjacency matrix of the graph. These basis vectors (in the matrices U or V) are ordered according to the amount of variance they explain in the original matrix. By selecting a subset of these basis vectors (through our choice of dimensionality reduction) we can find a lower dimensional space in which to represent the graph.
References
[Rc604f704dfdd1] Sussman, D.L., Tang, M., Fishkind, D.E., Priebe, C.E. "A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs," Journal of the American Statistical Association, Vol. 107(499), 2012 
fit
(self, graph, y=None)[source]¶ Fit ASE model to input graph
Parameters: graph : array_like or networkx.Graph
Input graph to embed.
Returns: self : object
Returns an instance of self.

fit_transform
(self, graph, y=None)¶ Fit the model with graphs and apply the transformation.
n_dimension is either automatically determined or based on user input.
Parameters: graph: np.ndarray or networkx.Graph
Input graph to embed.
Returns: out : np.ndarray OR length 2 tuple of np.ndarray.
If undirected then returns single np.ndarray of latent position, shape(n_vertices, n_components). If directed,
concat
is True then concatenate latent matrices on axis 1, shape(n_vertices, 2*n_components). If directed,concat
is False then tuple of the latent matrices. Each of shape (n_vertices, n_components).

get_params
(self, deep=True)¶ Get parameters for this estimator.
Parameters: deep : bool, default=True
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
(self, **params)¶ 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.Parameters: **params : dict
Estimator parameters.
Returns: self : object
Estimator instance.

class
graspologic.embed.
LaplacianSpectralEmbed
(form='DAD', n_components=None, n_elbows=2, algorithm='randomized', n_iter=5, check_lcc=True, regularizer=None, concat=False)[source]¶ Class for computing the laplacian spectral embedding of a graph.
The laplacian spectral embedding (LSE) is a kdimensional Euclidean representation of the graph based on its Laplacian matrix. It relies on an SVD to reduce the dimensionality to the specified k, or if k is unspecified, can find a number of dimensions automatically.
Read more in the tutorials
Parameters: form : {'DAD' (default), 'IDAD', 'RDAD'}, optional
Specifies the type of Laplacian normalization to use.
n_components : int or None, default = None
Desired dimensionality of output data. If "full", n_components must be <= min(X.shape). Otherwise, n_components must be < min(X.shape). If None, then optimal dimensions will be chosen by
select_dimension()
usingn_elbows
argument.n_elbows : int, optional, default: 2
If
n_components=None
, then compute the optimal embedding dimension usingselect_dimension()
. Otherwise, ignored.algorithm : {'randomized' (default), 'full', 'truncated'}, optional
SVD solver to use:
 'randomized'
 Computes randomized svd using
sklearn.utils.extmath.randomized_svd()
 'full'
 Computes full svd using
scipy.linalg.svd()
 'truncated'
 Computes truncated svd using
scipy.sparse.linalg.svds()
n_iter : int, optional (default = 5)
Number of iterations for randomized SVD solver. Not used by 'full' or 'truncated'. The default is larger than the default in randomized_svd to handle sparse matrices that may have large slowly decaying spectrum.
check_lcc : bool , optional (defult = True)
Whether to check if input graph is connected. May result in nonoptimal results if the graph is unconnected. If True and input is unconnected, a UserWarning is thrown. Not checking for connectedness may result in faster computation.
regularizer: int, float or None, optional (default=None)
Constant to be added to the diagonal of degree matrix. If None, average node degree is added. If int or float, must be >= 0. Only used when
form
== 'RDAD'.concat : bool, optional (default False)
If graph is directed, whether to concatenate left and right (out and in) latent positions along axis 1.
Attributes: n_features_in_: int
Number of features passed to the fit method.
latent_left_ : array, shape (n_samples, n_components)
Estimated left latent positions of the graph.
latent_right_ : array, shape (n_samples, n_components), or None
Only computed when the graph is directed, or adjacency matrix is assymetric. Estimated right latent positions of the graph. Otherwise, None.
singular_values_ : array, shape (n_components)
Singular values associated with the latent position matrices.
See also
Notes
The singular value decomposition:
\[A = U \Sigma V^T\]is used to find an orthonormal basis for a matrix, which in our case is the Laplacian matrix of the graph. These basis vectors (in the matrices U or V) are ordered according to the amount of variance they explain in the original matrix. By selecting a subset of these basis vectors (through our choice of dimensionality reduction) we can find a lower dimensional space in which to represent the graph.
References
[R6f539007e2711] Sussman, D.L., Tang, M., Fishkind, D.E., Priebe, C.E. "A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs," Journal of the American Statistical Association, Vol. 107(499), 2012. [R6f539007e2712] Von Luxburg, Ulrike. "A tutorial on spectral clustering," Statistics and computing, Vol. 17(4), pp. 395416, 2007. [R6f539007e2713] Rohe, Karl, Sourav Chatterjee, and Bin Yu. "Spectral clustering and the highdimensional stochastic blockmodel," The Annals of Statistics, Vol. 39(4), pp. 18781915, 2011. 
fit
(self, graph, y=None)[source]¶ Fit LSE model to input graph
By default, uses the Laplacian normalization of the form:
\[L = D^{1/2} A D^{1/2}\]Parameters: graph : array_like or networkx.Graph
Input graph to embed. see graspologic.utils.import_graph
Returns: self : object
Returns an instance of self.

fit_transform
(self, graph, y=None)¶ Fit the model with graphs and apply the transformation.
n_dimension is either automatically determined or based on user input.
Parameters: graph: np.ndarray or networkx.Graph
Input graph to embed.
Returns: out : np.ndarray OR length 2 tuple of np.ndarray.
If undirected then returns single np.ndarray of latent position, shape(n_vertices, n_components). If directed,
concat
is True then concatenate latent matrices on axis 1, shape(n_vertices, 2*n_components). If directed,concat
is False then tuple of the latent matrices. Each of shape (n_vertices, n_components).

get_params
(self, deep=True)¶ Get parameters for this estimator.
Parameters: deep : bool, default=True
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
(self, **params)¶ 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.Parameters: **params : dict
Estimator parameters.
Returns: self : object
Estimator instance.

graspologic.embed.
node2vec_embed
(graph: Union[networkx.classes.graph.Graph, networkx.classes.digraph.DiGraph], num_walks: int = 10, walk_length: int = 80, return_hyperparameter: float = 1.0, inout_hyperparameter: float = 1.0, dimensions: int = 128, window_size: int = 10, workers: int = 8, iterations: int = 1, interpolate_walk_lengths_by_node_degree: bool = True) → Tuple[numpy.ndarray, numpy.ndarray][source]¶ Generates a node2vec embedding from a given graph. Will follow the word2vec algorithm to create the embedding.
Parameters: graph: Union[nx.Graph, nx.DiGraph]
A networkx graph or digraph. A multigraph should be turned into a nonmultigraph so that the calling user properly handles the multiedges (i.e. aggregate weights or take last edge weight). If the graph is unweighted, the weight of each edge will default to 1.
num_walks : int
Number of walks per source. Default is 10.
walk_length: int
Length of walk per source. Default is 80.
return_hyperparameter : float
Return hyperparameter (p). Default is 1.0
inout_hyperparameter : float
Inout hyperparameter (q). Default is 1.0
dimensions : int
Dimensionality of the word vectors. Default is 128.
window_size : int
Maximum distance between the current and predicted word within a sentence. Default is 10.
workers : int
Use these many worker threads to train the model. Default is 8.
iterations : int
Number of epochs in stochastic gradient descent (SGD)
interpolate_walk_lengths_by_node_degree : bool
Use a dynamic walk length that corresponds to each nodes degree. If the node is in the bottom 20 percentile, default to a walk length of 1. If it is in the top 10 percentile, use walk_length. If it is in the 2080 percentiles, linearly interpolate between 1 and walk_length. This will reduce lower degree nodes from biasing your resulting embedding. If a low degree node has the same number of walks as a high degree node (which it will if this setting is not on), then the lower degree nodes will take a smaller breadth of random walks when compared to the high degree nodes. This will result in your lower degree walks dominating your higher degree nodes.
Returns: Tuple[np.ndarray, np.ndarray]
A tuple containing a matrix, with each row index corresponding to the embedding for each node. The tuple also contains a vector containing the corresponding vertex labels for each row in the matrix. The matrix and vector are positionally correlated.
Notes
 The original reference implementation of node2vec comes from Aditya Grover from
 https://github.com/adityagrover/node2vec/.
 Further details on the Alias Method used in this functionality can be found at
 https://lips.cs.princeton.edu/thealiasmethodefficientsamplingwithmanydiscreteoutcomes/
References
[1] Aditya Grover and Jure Leskovec "node2vec: Scalable Feature Learning for Networks." Knowledge Discovery and Data Mining, 2016.
Multiple graph embedding¶

class
graspologic.embed.
OmnibusEmbed
(n_components=None, n_elbows=2, algorithm='randomized', n_iter=5, check_lcc=True, diag_aug=True, concat=False)[source]¶ Omnibus embedding of arbitrary number of input graphs with matched vertex sets.
Given \(A_1, A_2, ..., A_m\) a collection of (possibly weighted) adjacency matrices of a collection \(m\) undirected graphs with matched vertices. Then the \((mn \times mn)\) omnibus matrix, \(M\), has the subgraph where \(M_{ij} = \frac{1}{2}(A_i + A_j)\). The omnibus matrix is then embedded using adjacency spectral embedding.
Read more in the tutorials
Parameters: n_components : int or None, default = None
Desired dimensionality of output data. If "full", n_components must be <= min(X.shape). Otherwise, n_components must be < min(X.shape). If None, then optimal dimensions will be chosen by
select_dimension()
usingn_elbows
argument.n_elbows : int, optional, default: 2
If
n_components=None
, then compute the optimal embedding dimension usingselect_dimension()
. Otherwise, ignored.algorithm : {'randomized' (default), 'full', 'truncated'}, optional
SVD solver to use:
 'randomized'
 Computes randomized svd using
sklearn.utils.extmath.randomized_svd()
 'full'
 Computes full svd using
scipy.linalg.svd()
 'truncated'
 Computes truncated svd using
scipy.sparse.linalg.svds()
n_iter : int, optional (default = 5)
Number of iterations for randomized SVD solver. Not used by 'full' or 'truncated'. The default is larger than the default in randomized_svd to handle sparse matrices that may have large slowly decaying spectrum.
check_lcc : bool , optional (defult = True)
Whether to check if the average of all input graphs are connected. May result in nonoptimal results if the average graph is unconnected. If True and average graph is unconnected, a UserWarning is thrown.
diag_aug : bool, optional (default = True)
Whether to replace the main diagonal of each adjacency matrices with a vector corresponding to the degree (or sum of edge weights for a weighted network) before embedding.
concat : bool, optional (default False)
If graph(s) are directed, whether to concatenate each graph's left and right (out and in) latent positions along axis 1.
Attributes: n_graphs_ : int
Number of graphs
n_vertices_ : int
Number of vertices in each graph
latent_left_ : array, shape (n_graphs, n_vertices, n_components)
Estimated left latent positions of the graph.
latent_right_ : array, shape (n_graphs, n_vertices, n_components), or None
Only computed when the graph is directed, or adjacency matrix is asymmetric. Estimated right latent positions of the graph. Otherwise, None.
singular_values_ : array, shape (n_components)
Singular values associated with the latent position matrices.
References
[R4f822401fe961] Levin, K., Athreya, A., Tang, M., Lyzinski, V., & Priebe, C. E. (2017, November). A central limit theorem for an omnibus embedding of multiple random dot product graphs. In Data Mining Workshops (ICDMW), 2017 IEEE International Conference on (pp. 964967). IEEE. 
fit
(self, graphs, y=None)[source]¶ Fit the model with graphs.
Parameters: graphs : list of nx.Graph or ndarray, or ndarray
If list of nx.Graph, each Graph must contain same number of nodes. If list of ndarray, each array must have shape (n_vertices, n_vertices). If ndarray, then array must have shape (n_graphs, n_vertices, n_vertices).
Returns: self : object
Returns an instance of self.

fit_transform
(self, graphs, y=None)[source]¶ Fit the model with graphs and apply the embedding on graphs. n_components is either automatically determined or based on user input.
Parameters: graphs : list of nx.Graph or ndarray, or ndarray
If list of nx.Graph, each Graph must contain same number of nodes. If list of ndarray, each array must have shape (n_vertices, n_vertices). If ndarray, then array must have shape (n_graphs, n_vertices, n_vertices).
Returns: out : np.ndarray or length 2 tuple of np.ndarray.
If input graphs were symmetric, ndarray of shape (n_graphs, n_vertices, n_components). If graphs were directed and
concat
is False, returns tuple of two arrays (same shape as above). The first corresponds to the left latent positions, and the second to the right latent positions. If graphs were directed andconcat
is True, left and right (out and in) latent positions are concatenated. In this case one tensor of shape (n_graphs, n_vertices, 2*n_components) is returned.

get_params
(self, deep=True)¶ Get parameters for this estimator.
Parameters: deep : bool, default=True
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
(self, **params)¶ 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.Parameters: **params : dict
Estimator parameters.
Returns: self : object
Estimator instance.

class
graspologic.embed.
MultipleASE
(n_components=None, n_elbows=2, algorithm='randomized', n_iter=5, scaled=True, diag_aug=True, concat=False)[source]¶ Multiple Adjacency Spectral Embedding (MASE) embeds arbitrary number of input graphs with matched vertex sets.
For a population of undirected graphs, MASE assumes that the population of graphs is sampled from \(VR^{(i)}V^T\) where \(V \in \mathbb{R}^{n\times d}\) and \(R^{(i)} \in \mathbb{R}^{d\times d}\). Score matrices, \(R^{(i)}\), are allowed to vary for each graph, but are symmetric. All graphs share a common a latent position matrix \(V\).
For a population of directed graphs, MASE assumes that the population is sampled from \(UR^{(i)}V^T\) where \(U \in \mathbb{R}^{n\times d_1}\), \(V \in \mathbb{R}^{n\times d_2}\), and \(R^{(i)} \in \mathbb{R}^{d_1\times d_2}\). In this case, score matrices \(R^{(i)}\) can be assymetric and nonsquare, but all graphs still share a common latent position matrices \(U\) and \(V\).
Parameters: n_components : int or None, default = None
Desired dimensionality of output data. If "full", n_components must be <= min(X.shape). Otherwise, n_components must be < min(X.shape). If None, then optimal dimensions will be chosen by
select_dimension()
usingn_elbows
argument.n_elbows : int, optional, default: 2
If
n_components=None
, then compute the optimal embedding dimension usingselect_dimension()
. Otherwise, ignored.algorithm : {'randomized' (default), 'full', 'truncated'}, optional
SVD solver to use:
 'randomized'
 Computes randomized svd using
sklearn.utils.extmath.randomized_svd()
 'full'
 Computes full svd using
scipy.linalg.svd()
 'truncated'
 Computes truncated svd using
scipy.sparse.linalg.svds()
n_iter : int, optional (default = 5)
Number of iterations for randomized SVD solver. Not used by 'full' or 'truncated'. The default is larger than the default in randomized_svd to handle sparse matrices that may have large slowly decaying spectrum.
scaled : bool, optional (default=True)
Whether to scale individual eigenvectors with eigenvalues in first embedding stage.
diag_aug : bool, optional (default = True)
Whether to replace the main diagonal of each adjacency matrices with a vector corresponding to the degree (or sum of edge weights for a weighted network) before embedding.
concat : bool, optional (default False)
If graph(s) are directed, whether to concatenate each graph's left and right (out and in) latent positions along axis 1.
Attributes: n_graphs_ : int
Number of graphs
n_vertices_ : int
Number of vertices in each graph
latent_left_ : array, shape (n_samples, n_components)
Estimated left latent positions of the graph.
latent_right_ : array, shape (n_samples, n_components), or None
Estimated right latent positions of the graph. Only computed when the an input graph is directed, or adjacency matrix is assymetric. Otherwise, None.
scores_ : array, shape (n_samples, n_components, n_components)
Estimated \(\hat{R}\) matrices for each input graph.
Notes
When an input graph is directed, n_components of latent_left_ may not be equal to n_components of latent_right_.

fit
(self, graphs, y=None)[source]¶ Fit the model with graphs.
Parameters: graphs : list of nx.Graph or ndarray, or ndarray
If list of nx.Graph, each Graph must contain same number of nodes. If list of ndarray, each array must have shape (n_vertices, n_vertices). If ndarray, then array must have shape (n_graphs, n_vertices, n_vertices).
Returns: self : object
Returns an instance of self.

fit_transform
(self, graphs, y=None)[source]¶ Fit the model with graphs and apply the embedding on graphs. n_components is either automatically determined or based on user input.
Parameters: graphs : list of nx.Graph or ndarray, or ndarray
If list of nx.Graph, each Graph must contain same number of nodes. If list of ndarray, each array must have shape (n_vertices, n_vertices). If ndarray, then array must have shape (n_graphs, n_vertices, n_vertices).
Returns: out : np.ndarray or length 2 tuple of np.ndarray.
If input graphs were symmetric shape (n_vertices, n_components). If graphs were directed and
concat
is False, returns tuple of two arrays (same shape as above). The first corresponds to the left latent positions, and the second to the right latent positions. Whenconcat
is True left and right (out and in) latent positions are concatenated along axis 1.

get_params
(self, deep=True)¶ Get parameters for this estimator.
Parameters: deep : bool, default=True
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
(self, **params)¶ 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.Parameters: **params : dict
Estimator parameters.
Returns: self : object
Estimator instance.

class
graspologic.embed.
mug2vec
(pass_to_ranks='simplenonzero', omnibus_components=None, omnibus_n_elbows=2, cmds_components=None, cmds_n_elbows=2)[source]¶ Multigraphs2vectors (mug2vec).
mug2vec is a sequence of three algorithms that learns a feature vector for each input graph.
Steps:
1. Pass to ranks  ranks all edge weights from smallest to largest valued edges then normalize by a constant.
2. Omnibus embedding  jointly learns a low dimensional matrix representation for all graphs under the random dot product model (RDPG).
3. Classical MDS (cMDS)  learns a feature vector for each graph by computing Euclidean distance between each pair of graph embeddings from omnibus embedding, followed by an eigen decomposition.
Parameters: pass_to_ranks: {'simplenonzero' (default), 'simpleall', 'zeroboost'} string, or None
 'simplenonzero'
 assigns ranks to all nonzero edges, settling ties using the average. Ranks are then scaled by \(\frac{rank(\text{nonzero edges})}{\text{total nonzero edges} + 1}\)
 'simpleall'
 assigns ranks to all nonzero edges, settling ties using the average. Ranks are then scaled by \(\frac{rank(\text{nonzero edges})}{n^2 + 1}\) where n is the number of nodes
 'zeroboost'
 preserves the edge weight for all 0s, but ranks the other edges as if the ranks of all 0 edges has been assigned. If there are 10 0valued edges, the lowest nonzero edge gets weight 11 / (number of possible edges). Ties settled by the average of the weight that those edges would have received. Number of possible edges is determined by the type of graph (loopless or looped, directed or undirected).
 None
 No pass to ranks applied.
omnibus_components, cmds_components : int or None, default = None
Desired dimensionality of output data. If "full", n_components must be <= min(X.shape). Otherwise, n_components must be < min(X.shape). If None, then optimal dimensions will be chosen by
select_dimension
usingn_elbows
argument.omnibus_n_elbows, cmds_n_elbows: int, optional, default: 2
If
n_components=None
, then compute the optimal embedding dimension usingselect_dimension
. Otherwise, ignored.Attributes: omnibus_n_components_ : int
Equals the parameter n_components. If input n_components was None, then equals the optimal embedding dimension.
cmds_n_components_ : int
Equals the parameter n_components. If input n_components was None, then equals the optimal embedding dimension.
embeddings_ : array, shape (n_components, n_features)
Embeddings from the pipeline. Each graph is a point in
n_features
dimensions.See also

fit
(self, graphs, y=None)[source]¶ Computes a vector for each graph.
Parameters: graphs : list of nx.Graph or ndarray, or ndarray
If list of nx.Graph, each Graph must contain same number of nodes. If list of ndarray, each array must have shape (n_vertices, n_vertices). If ndarray, then array must have shape (n_graphs, n_vertices, n_vertices).
 y : Ignored
Returns:  self : returns an instance of self.

fit_transform
(self, graphs, y=None)[source]¶ Computes a vector for each graph.
Parameters: graphs : list of nx.Graph or ndarray, or ndarray
If list of nx.Graph, each Graph must contain same number of nodes. If list of ndarray, each array must have shape (n_vertices, n_vertices). If ndarray, then array must have shape (n_graphs, n_vertices, n_vertices).
 y : Ignored
Returns:  embeddings : returns an instance of self.

get_params
(self, deep=True)¶ Get parameters for this estimator.
Parameters: deep : bool, default=True
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
(self, **params)¶ 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.Parameters: **params : dict
Estimator parameters.
Returns: self : object
Estimator instance.
Dissimilarity graph embedding¶

class
graspologic.embed.
ClassicalMDS
(n_components=None, n_elbows=2, dissimilarity='euclidean')[source]¶ Classical multidimensional scaling (cMDS).
cMDS seeks a lowdimensional representation of the data in which the distances respect well the distances in the original highdimensional space.
Parameters: n_components : int, or None (default=None)
Number of components to keep. If None, then it will run
select_dimension
to find the optimal embedding dimension.n_elbows : int, or None (default=2)
If
n_components=None
, then compute the optimal embedding dimension using :func:`~graspologic.embed.select_dimension. Otherwise, ignored.dissimilarity : 'euclidean'  'precomputed', optional, default: 'euclidean'
Dissimilarity measure to use:
 'euclidean'
 Pairwise Euclidean distances between points in the dataset.
 'precomputed'
 Precomputed dissimilarities are passed directly to
fit
andfit_transform
.
Attributes: n_components_ : int
Equals the parameter n_components. If input n_components was None, then equals the optimal embedding dimension.
n_features_in_: int
Number of features passed to the fit method.
components_ : array, shape (n_components, n_features)
Principal axes in feature space.
singular_values_ : array, shape (n_components,)
The singular values corresponding to each of the selected components.
dissimilarity_matrix_ : array, shape (n_features, n_features)
Dissimilarity matrix
See also
References
Wickelmaier, Florian. "An introduction to MDS." Sound Quality Research Unit, Aalborg University, Denmark 46.5 (2003).

fit
(self, X, y=None)[source]¶ Fit the model with X.
Parameters: X : array_like
If
dissimilarity=='precomputed'
, the input should be the dissimilarity matrix with shape (n_samples, n_samples). Ifdissimilarity=='euclidean'
, then the input should be 2darray with shape (n_samples, n_features) or a 3darray with shape (n_samples, n_features_1, n_features_2).Returns: self : object
Returns an instance of self.

fit_transform
(self, X, y=None)[source]¶ Fit the data from X, and returns the embedded coordinates.
Parameters: X : ndarray
If
dissimilarity=='precomputed'
, the input should be the dissimilarity matrix with shape (n_samples, n_samples). Ifdissimilarity=='euclidean'
, then the input should be array with shape (n_samples, n_features) or a ndarray with shape (n_samples, n_features_1, n_features_2, ..., n_features_d). First axis of ndarray must ben_samples
.Returns: X_new : arraylike, shape (n_samples, n_components)
Embedded input.

get_params
(self, deep=True)¶ Get parameters for this estimator.
Parameters: deep : bool, default=True
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
(self, **params)¶ 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.Parameters: **params : dict
Estimator parameters.
Returns: self : object
Estimator instance.