Hierarchical Clustering and Signal Denoising on Digraphs
A representation of a digraph as a Hermitian matrix derived from its adjacency matrix that characterizes both the connectivity and the edge orientation of the digraph is proposed and the superiority of this algorithm for digraph clustering across diverse graph structural properties and supervision settings is demonstra...