Description Usage Arguments Value Author(s) References Examples
It does
1. do a pass-to-rank for a weighted graph (PTR, no-op for an unweighted graph),
2. do a graph spectral embedding (ASE
or LSE
) with a _diagonal augmentation_,
3. do a _dimension reduction_ (ZG) and merge left and right vectors (no-op for an undirected graph),
4. cluster vertices (GMM or Kmeans).
1 2 3 |
g |
a graph in |
dmax |
maximum dimension for embedding |
elb |
an index for elbow |
abs |
a boolean to take abs on elbow finder or not |
embed |
either |
clustering |
either |
Kmax |
maximum number of clusters |
weight |
either |
verbose |
boolean to determine whether to display an intermediate fitting progress status of |
doplot |
boolean to determine whether to draw plots or not, default is |
g
the largest connected component of the input graph
mc
clustering output object
Y
labels for the clustering
Youngser Park <youngser@jhu.edu>
D.L. Sussman, M. Tang, D.E. Fishkind, and C.E. Priebe, A consistent adjacency spectral embedding for stochastic blockmodel graphs, Journal of the American Statistical Association, Vol. 107, No. 499, pp. 1119-1128, 2012.
1 2 3 4 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.