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...
Päätekijät: | Underwood, WG, Elliott, A, Cucuringu, M |
---|---|
Aineistotyyppi: | Journal article |
Kieli: | English |
Julkaistu: |
SpringerOpen
2020
|
Samankaltaisia teoksia
-
Motif-based spectral clustering of weighted directed networks
Tekijä: William G. Underwood, et al.
Julkaistu: (2020-09-01) -
Motif adjacency matrix and spectral clustering of directed weighted networks
Tekijä: Yike Wang, et al.
Julkaistu: (2023-04-01) -
Simple and scalable constrained clustering: a generalized spectral method
Tekijä: Cucuringu, M
Julkaistu: (2016) -
Hermitian matrices for clustering directed graphs: insights and applications
Tekijä: Cucuringu, M
Julkaistu: (2019) -
Core-periphery structure in directed networks
Tekijä: Elliott, A, et al.
Julkaistu: (2020)