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...
Glavni avtor: | Cucuringu, M |
---|---|
Format: | Working paper |
Izdano: |
2019
|
Podobne knjige/članki
-
Hermitian Laplacian Matrix of Directed Graphs
od: LIU Kaiwen, HUANG Zengfeng
Izdano: (2023-01-01) -
Refinements of Kantorovich Inequality for Hermitian Matrices
od: Feixiang Chen
Izdano: (2012-01-01) -
Hermitian matrices of roots of unity and their characteristic polynomials
od: Greaves, Gary Royden Watson, et al.
Izdano: (2023) -
Degeneracies and symmetry breaking in pseudo-Hermitian matrices
od: Abhijeet Melkani
Izdano: (2023-04-01) -
Universality classes of non-Hermitian random matrices
od: Ryusuke Hamazaki, et al.
Izdano: (2020-06-01)