Routines for spectral clustering on a (possibly directed) (possibly weighted) graph. It performs spectral embedding of adjacency or Laplacian matrix of a given graph and then clusters vertices using either Gaussian mixture modeling or K-means.
Package details |
|
---|---|
Author | Youngser Park |
Maintainer | Youngser Park <youngser@jhu.edu> |
License | GPL (>= 2) |
Version | 0.1.0 |
URL | https://github.com/youngser/gmmase |
Package repository | View on GitHub |
Installation |
Install the latest version of this package by entering the following in R:
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.