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...
Hlavní autor: | Cucuringu, M |
---|---|
Médium: | Working paper |
Vydáno: |
2019
|
Podobné jednotky
-
Hermitian Laplacian Matrix of Directed Graphs
Autor: LIU Kaiwen, HUANG Zengfeng
Vydáno: (2023-01-01) -
Refinements of Kantorovich Inequality for Hermitian Matrices
Autor: Feixiang Chen
Vydáno: (2012-01-01) -
Hermitian matrices of roots of unity and their characteristic polynomials
Autor: Greaves, Gary Royden Watson, a další
Vydáno: (2023) -
Degeneracies and symmetry breaking in pseudo-Hermitian matrices
Autor: Abhijeet Melkani
Vydáno: (2023-04-01) -
Universality classes of non-Hermitian random matrices
Autor: Ryusuke Hamazaki, a další
Vydáno: (2020-06-01)