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