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...
Tác giả chính: | Cucuringu, M |
---|---|
Định dạng: | Working paper |
Được phát hành: |
2019
|
Những quyển sách tương tự
-
Hermitian Laplacian Matrix of Directed Graphs
Bằng: LIU Kaiwen, HUANG Zengfeng
Được phát hành: (2023-01-01) -
Refinements of Kantorovich Inequality for Hermitian Matrices
Bằng: Feixiang Chen
Được phát hành: (2012-01-01) -
Hermitian matrices of roots of unity and their characteristic polynomials
Bằng: Greaves, Gary Royden Watson, et al.
Được phát hành: (2023) -
Degeneracies and symmetry breaking in pseudo-Hermitian matrices
Bằng: Abhijeet Melkani
Được phát hành: (2023-04-01) -
Universality classes of non-Hermitian random matrices
Bằng: Ryusuke Hamazaki, et al.
Được phát hành: (2020-06-01)