Hermitian matrices for clustering directed graphs: insights and applications
<p style="text-align:justify;"> Graph clustering is a basic technique in data mining, and has widespread applications in different domains. While spectral techniques have been successfully applied for clustering undirected graphs, the performance of spectral clustering algorithms fo...
Hovedforfatter: | Cucuringu, M |
---|---|
Format: | Working paper |
Udgivet: |
2019
|
Lignende værker
-
Hermitian Laplacian Matrix of Directed Graphs
af: LIU Kaiwen, HUANG Zengfeng
Udgivet: (2023-01-01) -
Refinements of Kantorovich Inequality for Hermitian Matrices
af: Feixiang Chen
Udgivet: (2012-01-01) -
Hermitian matrices of roots of unity and their characteristic polynomials
af: Greaves, Gary Royden Watson, et al.
Udgivet: (2023) -
Degeneracies and symmetry breaking in pseudo-Hermitian matrices
af: Abhijeet Melkani
Udgivet: (2023-04-01) -
Universality classes of non-Hermitian random matrices
af: Ryusuke Hamazaki, et al.
Udgivet: (2020-06-01)