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

no code implementations • 6 Apr 2022 • Stefan Klus, Natasa Djurdjevac Conrad

While spectral clustering algorithms for undirected graphs are well established and have been successfully applied to unsupervised machine learning problems ranging from image segmentation and genome sequencing to signal processing and social network analysis, clustering directed graphs remains notoriously difficult.

Clustering Image Segmentation +1