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)