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...
Հիմնական հեղինակ: | Cucuringu, M |
---|---|
Ձևաչափ: | Working paper |
Հրապարակվել է: |
2019
|
Նմանատիպ նյութեր
-
Hermitian Laplacian Matrix of Directed Graphs
: LIU Kaiwen, HUANG Zengfeng
Հրապարակվել է: (2023-01-01) -
Refinements of Kantorovich Inequality for Hermitian Matrices
: Feixiang Chen
Հրապարակվել է: (2012-01-01) -
Hermitian matrices of roots of unity and their characteristic polynomials
: Greaves, Gary Royden Watson, և այլն
Հրապարակվել է: (2023) -
Degeneracies and symmetry breaking in pseudo-Hermitian matrices
: Abhijeet Melkani
Հրապարակվել է: (2023-04-01) -
Universality classes of non-Hermitian random matrices
: Ryusuke Hamazaki, և այլն
Հրապարակվել է: (2020-06-01)