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)