Steinar Laenen
Steinar Laenen
Home
Publications
Experience
Light
Dark
Automatic
Spectral Graph Theory
Higher-Order Spectral Clustering of Directed Graphs
We show that a path-like cluster structure can be found in directed graphs, by performing spectral clustering on the first eigenvector of a newly defined Hermitian adjacency matrix.
Steinar Laenen
,
He Sun
PDF
Cite
Video
Cite
×