Python implementation for Motif-based spectral clustering method for single cluster.
Motif-based spectral clustering method is an algorithm posted in Higher-order Organization of Complex Networks by Austin R. Benson, David F. Gleich, and Jure Leskovec.
The implemented Code is here.
The algorithm performs the following steps:
- input Graph G, unweighted and directed.
- Using G form a new weighted graph W.
- Apply spectral clustering on W.
- Output the clusters for each 7 motifs.
- Examine each output to see which motif has thebest cluster.
- Return best cluster and the motif used to get that cluster.
Higher-order Organization of Complex Networks. Austin R. Benson, David F. Gleich, and Jure Leskovec. Science, vol. 353, no. 6295, pp. 163-166, 2016.