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)