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...
| প্রধান লেখক: | |
|---|---|
| বিন্যাস: | Working paper |
| প্রকাশিত: |
2019
|