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...
Huvudupphovsmän: | Underwood, WG, Elliott, A, Cucuringu, M |
---|---|
Materialtyp: | Journal article |
Språk: | English |
Publicerad: |
SpringerOpen
2020
|
Liknande verk
Liknande verk
-
Motif-based spectral clustering of weighted directed networks
av: William G. Underwood, et al.
Publicerad: (2020-09-01) -
Motif adjacency matrix and spectral clustering of directed weighted networks
av: Yike Wang, et al.
Publicerad: (2023-04-01) -
Simple and scalable constrained clustering: a generalized spectral method
av: Cucuringu, M
Publicerad: (2016) -
Hermitian matrices for clustering directed graphs: insights and applications
av: Cucuringu, M
Publicerad: (2019) -
Core-periphery structure in directed networks
av: Elliott, A, et al.
Publicerad: (2020)