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)