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...
Príomhchruthaitheoir: | Cucuringu, M |
---|---|
Formáid: | Working paper |
Foilsithe / Cruthaithe: |
2019
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Hermitian Laplacian Matrix of Directed Graphs
de réir: LIU Kaiwen, HUANG Zengfeng
Foilsithe / Cruthaithe: (2023-01-01) -
Refinements of Kantorovich Inequality for Hermitian Matrices
de réir: Feixiang Chen
Foilsithe / Cruthaithe: (2012-01-01) -
Hermitian matrices of roots of unity and their characteristic polynomials
de réir: Greaves, Gary Royden Watson, et al.
Foilsithe / Cruthaithe: (2023) -
Degeneracies and symmetry breaking in pseudo-Hermitian matrices
de réir: Abhijeet Melkani
Foilsithe / Cruthaithe: (2023-04-01) -
Universality classes of non-Hermitian random matrices
de réir: Ryusuke Hamazaki, et al.
Foilsithe / Cruthaithe: (2020-06-01)