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...
প্রধান লেখক: | Underwood, WG, Elliott, A, Cucuringu, M |
---|---|
বিন্যাস: | Journal article |
ভাষা: | English |
প্রকাশিত: |
SpringerOpen
2020
|
অনুরূপ উপাদানগুলি
অনুরূপ উপাদানগুলি
-
Motif-based spectral clustering of weighted directed networks
অনুযায়ী: William G. Underwood, অন্যান্য
প্রকাশিত: (2020-09-01) -
Motif adjacency matrix and spectral clustering of directed weighted networks
অনুযায়ী: Yike Wang, অন্যান্য
প্রকাশিত: (2023-04-01) -
Simple and scalable constrained clustering: a generalized spectral method
অনুযায়ী: Cucuringu, M
প্রকাশিত: (2016) -
Hermitian matrices for clustering directed graphs: insights and applications
অনুযায়ী: Cucuringu, M
প্রকাশিত: (2019) -
Core-periphery structure in directed networks
অনুযায়ী: Elliott, A, অন্যান্য
প্রকাশিত: (2020)