Skew Symmetric Adjacency Matrices for Clustering Directed Graphs
Published in 2022 IEEE International Conference on Big Data (Big Data), 2022
Recommended citation: K. Hayashi, S. G. Aksoy and H. Park, "Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs," 2022 IEEE International Conference on Big Data (Big Data), Osaka, Japan, 2022, pp. 555-564, doi: 10.1109/BigData55660.2022.10020413. http://hayakb95.github.io/files/BigData_2022.pdf
We develope a spectral algorithm for clustering directed Graphs. The method uses spectal properties of the Skew-Symmetric Adjacency matrix to find clusters with large imbalanced cuts.
Recommended citation: ‘K. Hayashi, S. G. Aksoy and H. Park, “Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs,” 2022 IEEE International Conference on Big Data (Big Data), Osaka, Japan, 2022, pp. 555-564, doi: 10.1109/BigData55660.2022.10020413.’ 2022 IEEE International Conference on Big Data (Big Data).