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...
Prif Awdur: | Cucuringu, M |
---|---|
Fformat: | Working paper |
Cyhoeddwyd: |
2019
|
Eitemau Tebyg
-
Hermitian Laplacian Matrix of Directed Graphs
gan: LIU Kaiwen, HUANG Zengfeng
Cyhoeddwyd: (2023-01-01) -
Refinements of Kantorovich Inequality for Hermitian Matrices
gan: Feixiang Chen
Cyhoeddwyd: (2012-01-01) -
Hermitian matrices of roots of unity and their characteristic polynomials
gan: Greaves, Gary Royden Watson, et al.
Cyhoeddwyd: (2023) -
Degeneracies and symmetry breaking in pseudo-Hermitian matrices
gan: Abhijeet Melkani
Cyhoeddwyd: (2023-04-01) -
Universality classes of non-Hermitian random matrices
gan: Ryusuke Hamazaki, et al.
Cyhoeddwyd: (2020-06-01)