Motif-based spectral clustering of weighted directed networks
Clustering is an essential technique for network analysis, with applications in a diverse range of fields. Although spectral clustering is a popular and effective method, it fails to consider higher-order structure and can perform poorly on directed networks. One approach is to capture and cluster h...
Main Authors: | Underwood, WG, Elliott, A, Cucuringu, M |
---|---|
Format: | Journal article |
Language: | English |
Published: |
SpringerOpen
2020
|
Similar Items
-
Motif-based spectral clustering of weighted directed networks
by: William G. Underwood, et al.
Published: (2020-09-01) -
Motif adjacency matrix and spectral clustering of directed weighted networks
by: Yike Wang, et al.
Published: (2023-04-01) -
Simple and scalable constrained clustering: a generalized spectral method
by: Cucuringu, M
Published: (2016) -
Hermitian matrices for clustering directed graphs: insights and applications
by: Cucuringu, M
Published: (2019) -
Core-periphery structure in directed networks
by: Elliott, A, et al.
Published: (2020)