Higher-Order Spectral Clustering of Directed Graphs

by   Steinar Laenen, et al.

Clustering is an important topic in algorithms, and has a number of applications in machine learning, computer vision, statistics, and several other research disciplines. Traditional objectives of graph clustering are to find clusters with low conductance. Not only are these objectives just applicable for undirected graphs, they are also incapable to take the relationships between clusters into account, which could be crucial for many applications. To overcome these downsides, we study directed graphs (digraphs) whose clusters exhibit further "structural" information amongst each other. Based on the Hermitian matrix representation of digraphs, we present a nearly-linear time algorithm for digraph clustering, and further show that our proposed algorithm can be implemented in sublinear time under reasonable assumptions. The significance of our theoretical work is demonstrated by extensive experimental results on the UN Comtrade Dataset: the output clustering of our algorithm exhibits not only how the clusters (sets of countries) relate to each other with respect to their import and export records, but also how these clusters evolve over time, in accordance with known facts in international trade.


page 8

page 9

page 23


Koopman-based spectral clustering of directed and time-evolving graphs

While spectral clustering algorithms for undirected graphs are well esta...

Clustering - What Both Theoreticians and Practitioners are Doing Wrong

Unsupervised learning is widely recognized as one of the most important ...

Hermitian matrices for clustering directed graphs: insights and applications

Graph clustering is a basic technique in machine learning, and has wides...

Generalized Spectral Clustering for Directed and Undirected Graphs

Spectral clustering is a popular approach for clustering undirected grap...

Spectral Clustering with Smooth Tiny Clusters

Spectral clustering is one of the most prominent clustering approaches. ...

Spectral clustering algorithms for the detection of clusters in block-cyclic and block-acyclic graphs

We propose two spectral algorithms for partitioning nodes in directed gr...

Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs

Cut-based directed graph (digraph) clustering often focuses on finding d...

Please sign up or login with your details

Forgot password? Click here to reset